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=39
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the geodetic number of a graph
Gary Chartrand
,
Frank Harary
,
Ping Zhang
Networks
39
(1), 2002, pp. 1-6
A comparative analysis of several formulations for the generalized minimum spanning tree problem
Corinne Feremans
,
Martine Labbé
,
Gilbert Laporte
Networks
39
(1), 2002, pp. 29-34
Balanced network flows - VII: Primal-dual algorithms
Christian Fremuth-Paeger
,
Dieter Jungnickel
Networks
39
(1), 2002, pp. 35-42
On multiroute maximum flows in networks
Charu C. Aggarwal
,
James B. Orlin
Networks
39
(1), 2002, pp. 43-52
A linear-size zero-one programming model for the minimum spanning tree problem in planar graphs
Justin C. Williams
Networks
39
(1), 2002, pp. 53-60
Partial line directed hypergraphs
Daniela Ferrero
,
Carles Padró
Networks
39
(2), 2002, pp. 61-67
A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone
Glenn K. Manacher
,
Terrance A. Mankus
Networks
39
(2), 2002, pp. 68-72
Edge-cutsets in the directed hypercube
Paul L. Mariz
,
Shahriar Shahriari
Networks
39
(2), 2002, pp. 73-76
Minimum-weight rooted not-necessarily-spanning arborescence problem
V. Venkata Rao
,
R. Sridharan
Networks
39
(2), 2002, pp. 77-87
Deterministic radio broadcasting at low cost
Anders Dessmark
,
Andrzej Pelc
Networks
39
(2), 2002, pp. 88-97
Oriented hypercubes
Pierre Fraigniaud
,
Jean-Claude König
,
Emmanuel Lazard
Networks
39
(2), 2002, pp. 98-106
Models for the design and analysis of a large package sort facility
Paul McAree
,
Lawrence Bodin
,
Michael Ball
Networks
39
(2), 2002, pp. 107-120
Degree- and time-constrained broadcast networks
Michael J. Dinneen
,
Geoffrey Pritchard
,
Mark C. Wilson
Networks
39
(3), 2002, pp. 121-129
Light graphs with small routing cost
Bang Ye Wu
,
Kun-Mao Chao
,
Chuan Yi Tang
Networks
39
(3), 2002, pp. 130-138
Worst-case incremental analysis for a class of
p
-facility location problems
R.L. Francis
,
T.J. Lowe
,
A. Tamir
Networks
39
(3), 2002, pp. 139-143
Efficient algorithms for centers and medians in interval and circular-arc graphs
Sergei Bespamyatnikh
,
Binay Bhattacharya
,
Mark Keil
,
David Kirkpatrick
,
Michael Segal
Networks
39
(3), 2002, pp. 144-152
Superconnected digraphs and graphs with small conditional diameters
C. Balbuena
,
J. Fàbrega
,
X. Marcote
,
I. Pelayo
Networks
39
(3), 2002, pp. 153-160
Exact algorithms for minimum routing cost trees
Matteo Fischetti
,
Giuseppe Lancia
,
Paolo Serafini
Networks
39
(3), 2002, pp. 161-173
Lazy evaluation in Penniless propagation over join trees
Andrés Cano
,
Serafín Moral
,
Antonio Salmerón
Networks
39
(4), 2002, pp. 175-185
Forbidden subpaths for Steiner minimum networks in uniform orientation metrics
M. Brazil
,
D.A. Thomas
,
J.F. Weng
Networks
39
(4), 2002, pp. 186-202
Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks
Yoshiyuki Karuno
,
Hiroshi Nagamochi
,
Toshihide Ibaraki
Networks
39
(4), 2002, pp. 203-209
Length-constrained path-matchings in graphs
M. Ghodsi
,
M.T. Hajiaghayi
,
M. Mahdian
,
V.S. Mirrokni
Networks
39
(4), 2002, pp. 210-215
Dimensioning multicast-enabled communications networks
Mikael Prytz
,
Anders Forsgren
Networks
39
(4), 2002, pp. 216-231