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 Volume=47
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Nearly optimal three dimensional layout of hypercube networks
Tiziana Calamoneri
,
Annalisa Massini
Networks
47
(1), 2006, pp. 1-8
Fault tolerant on-board networks with priorities
J.-C. Bermond
,
F. Havet
,
C.D. Tóth
Networks
47
(1), 2006, pp. 9-25
The
k
-degree Cayley graph and its topological properties
Sun-Yuan Hsieh
,
Tien-Te Hsiao
Networks
47
(1), 2006, pp. 26-36
Distributed delay constrained multicast routing algorithm with efficient fault recovery
Hasan Ural
,
Keqin Zhu
Networks
47
(1), 2006, pp. 37-51
Exact methods based on node-routing formulations for undirected arc-routing problems
R. Baldacci
,
V. Maniezzo
Networks
47
(1), 2006, pp. 52-60
Black hole search in common interconnection networks
S. Dobrev
,
P. Flocchini
,
R. Královic̑
,
P. Ruz̑ic̑ka
,
G. Prencipe
,
N. Santoro
Networks
47
(2), 2006, pp. 61-71
Upgrading arcs to minimize the maximum travel time in a network
Ann Melissa Campbell
,
Timothy J. Lowe
,
Li Zhang
Networks
47
(2), 2006, pp. 72-80
The multiroute maximum flow problem revisited
Donglei Du
,
R. Chandrasekaran
Networks
47
(2), 2006, pp. 81-92
Fixed tree games with multilocated players
S. Miquel
,
B. van Velzen
,
H. Hamers
,
H. Norde
Networks
47
(2), 2006, pp. 93-101
All
(k;g)
-cages are edge-superconnected
Yuqing Lin
,
Mirka Miller
,
C. Balbuena
,
X. Marcote
Networks
47
(2), 2006, pp. 102-110
Lower bounds for the relative greedy algorithm for approximating Steiner trees
Stefan Hougardy
,
Stefan Kirchner
Networks
47
(2), 2006, pp. 111-115
An integer programming approach to routing in daisy networks
Johanna Becker
,
Zsolt Csizmadia
,
Jérôme Galtier
,
Alexandre Laugier
,
Jácint Szabó
,
László Szeg\Ho
Networks
47
(2), 2006, pp. 116-121
k
-partition-based facets of the network design problem
Yogesh K. Agarwal
Networks
47
(3), 2006, pp. 123-139
Two new families of large compound graphs
J. Gómez Martí
,
M. Miller
Networks
47
(3), 2006, pp. 140-146
Approximation algorithms for some
k
-source shortest paths spanning tree problems
Yen Hung Chen
,
Bang Ye Wu
,
Chuan Yi Tang R. Královic̑ and
Networks
47
(3), 2006, pp. 147-156
A column generation approach for SONET ring assignment
Elder M. Macambira
,
Nelson Maculan
,
Cid C. de Souza
Networks
47
(3), 2006, pp. 157-171
Harmonic broadcasting is bandwidth-optimal assuming constant bit rate
Lars Engebretsen
,
Madhu Sudan
Networks
47
(3), 2006, pp. 172-177
Approximation algorithms for the
k
-source multicast tree construction problem
Paraskevi Fragopoulou
Networks
47
(3), 2006, pp. 178-183
A bidirected generalization of network matrices
Gautam Appa
,
Balázs Kotnyek
Networks
47
(4), 2006, pp. 185-198
Variations of the prize-collecting Steiner tree problem
Olena Chapovska
,
Abraham P. Punnen
Networks
47
(4), 2006, pp. 199-205
Obtaining online approximation algorithms for facility dispersion from offline algorithms
Daniel J. Rosenkrantz
,
Giri K. Tayi
,
S.S. Ravi
Networks
47
(4), 2006, pp. 206-217
Minimum multiple message broadcast graphs
Hovhannes A. Harutyunyan
Networks
47
(4), 2006, pp. 218-224
Approximation algorithms for channel allocation problems in broadcast networks
Rajiv Gandhi
,
Samir Khuller
,
Aravind Srinivasan
,
Nan Wang
Networks
47
(4), 2006, pp. 225-236
The bi-criteria doubly weighted center-median path problem on a tree
J. Puerto
,
A.M. Rodríguez-Chía
,
A. Tamir
,
D. Pérez-Brito
Networks
47
(4), 2006, pp. 237-247