Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Networks AND YEAR=2003
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Algorithms for source-to-all maximum cost-to-time ratio problem in acyclic networks
Alexandra Makri
,
Diego Klabjan
Networks
42
(1), 2003, pp. 1-14
The spectra of wrapped butterfly digraphs
Francesc Comellas
,
Miquel Angel Fiol
,
Joan Gimbert
,
Margarida Mitjana
Networks
42
(1), 2003, pp. 15-19
A general construction for nonblocking crosstalk-free photonic switching networks
Frank K. Hwang
,
Wen-Dar Lin
Networks
42
(1), 2003, pp. 20-25
An exact algorithm for the Traveling Salesman problem with deliveries and collections
R. Baldacci
,
E. Hadjiconstantinou
,
A. Mingozzi
Networks
42
(1), 2003, pp. 26-41
The facility location problem with general cost functions
M.T. Hajiaghayi
,
M. Mahdian
,
V.S. Mirrokni
Networks
42
(1), 2003, pp. 42-47
Solving the
p
-center problem with tabu search and variable neighborhood search
Nenad Mladenović
,
Martine Labbé
,
Pierre Hansen
Networks
42
(1), 2003, pp. 48-64
Network optimization in supply chain management and financial engineering: An annotated bibliography
Joseph Geunes
,
Panos M. Pardalos
Networks
42
(2), 2003, pp. 66-84
Cycle embedding in faulty wrapped butterfly graphs
Chang-Hsiung Tsai
,
Tyne Liang
,
Lih-Hsing Hsu
,
Men-Yang Lin
Networks
42
(2), 2003, pp. 85-96
The performance of QoS-aware IP multicast routing protocols
Chih-Jen Tseng
,
Chyou-Hwa Chen
Networks
42
(2), 2003, pp. 97-108
Some recent contributions to routing and location problems
A. Corberán
,
E. Mota
,
J.J. Salazar
Networks
42
(2), 2003, pp. 109-113
An annotated bibliography of network interior point methods
Mauricio G.C. Resende
,
Geraldo Veiga
Networks
42
(2), 2003, pp. 114-121
Broadcasting in generalized chordal rings
F. Comellas
,
P. Hell
Networks
42
(3), 2003, pp. 123-134
Improved preprocessing, labeling and scaling algorithms for the weight-constrained shortest path problem
I. Dumitrescu
,
N. Boland
Networks
42
(3), 2003, pp. 135-153
Reoptimizing the Traveling Salesman problem
Claudia Archetti
,
Luca Bertazzi
,
M. Grazia Speranza
Networks
42
(3), 2003, pp. 154-159
A linear algorithm for compact box-drawings of trees
Masud Hasan
,
Md. Saidur Rahman
,
Takao Nishizeki
Networks
42
(3), 2003, pp. 160-164
The linear arrangement problem on recursively constructed graphs
S. Horton
,
T. Easton
,
R. Gary Parker
Networks
42
(3), 2003, pp. 165-168
Locating information with uncertainty in fully interconnected networks: The case of nondistributed memory
Lefteris M. Kirousis
,
Evangelos Kranakis
,
Danny Krizanc
,
Yannis C. Stamatiou
Networks
42
(3), 2003, pp. 169-180
Unilaterally connected large digraphs and generalized cycles
José Gómez
,
Eduardo A. Canale
,
Xavier Muñoz
Networks
42
(4), 2003, pp. 181-188
Fault Hamiltonicity and fault Hamiltonian connectivity of the
(n, k)
-star graphs
Hong-Chun Hsu
,
Yi-Lin Hsieh
,
Jimmy J.M. Tan
,
Lih-Hsing Hsu
Networks
42
(4), 2003, pp. 189-201
A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
Xiuzhen Cheng
,
Xiao Huang
,
Deying Li
,
Weili Wu
,
Ding-Zhu Du
Networks
42
(4), 2003, pp. 202-208
On the power of BFS to determine a graph's diameter
Derek G. Corneil
,
Feodor F. Dragan
,
Ekkehard Köhler
Networks
42
(4), 2003, pp. 209-222
Multifacility ordered median problems on networks: A further analysis
Jörg Kalcsics
,
Stefan Nickel
,
Justo Puerto
Networks
41
(1), 2003, pp. 1-12
The SONET edge-partition problem
Olivier Goldschmidt
,
Dorit S. Hochbaum
,
Asaf Levin
,
Eli V. Olinick
Networks
41
(1), 2003, pp. 13-23
Upgrading trees under diameter and budget constraints
Victor Chepoi
,
Hartmut Noltemeier
,
Yann Vaxès
Networks
41
(1), 2003, pp. 24-35
Toward faster algorithms for dynamic traffic assignment - I. parametric quickest-path trees
Robert B. Dial
Networks
41
(1), 2003, pp. 36-43
Seiten 1
2
>