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=2000
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The cardinality-constrained shortest path problem in 2-graphs
Geir Dahl
,
Bjrnar Realfsen
Networks
36
(1), 2000, pp. 1-8
A characterization of the two-commodity network design problem
Trilochan Sastry
Networks
36
(1), 2000, pp. 9-16
Constrained length connectivity and survivable networks
Walid Ben Ameur
Networks
36
(1), 2000, pp. 17-33
On the cycle polytope of a directed graph
Egon Balas
,
Maarten Oosten
Networks
36
(1), 2000, pp. 34-46
Minimizing the complexity of an activity network
Jerzy Kamburowski
,
David J. Michael
,
Matthias F.M. Stallmann
Networks
36
(1), 2000, pp. 47-52
New polynomial-time cycle-canceling algorithms for minimum-cost flows
P.T. Sokkalingam
,
Ravindra K. Ahuja
,
James B. Orlin
Networks
36
(1), 2000, pp. 53-63
Realizability of
p
-point,
q
-line graphs with prescribed maximum degree and line connectivity or minimum degree
D. DiMarco
Networks
36
(1), 2000, pp. 64-67
A polyhedral study of the asymmetric Traveling Salesman problem with time windows
Norbert Ascheuer
,
Matteo Fischetti
,
Martin Grötschel
Networks
36
(2), 2000, pp. 69-79
Efficient modeling of travel in networks with time-varying link speeds
Mark E.T. Horn
Networks
36
(2), 2000, pp. 80-90
Embedding interconnection networks in grids via the layered cross product
Guy Even
,
Shimon Even
Networks
36
(2), 2000, pp. 91-95
Impact of topographic information on graph exploration efficiency
Petrişor Panaite
,
Andrzej Pelc
Networks
36
(2), 2000, pp. 96-103
The local Steiner problem in normed planes
Konrad J. Swanepoel
Networks
36
(2), 2000, pp. 104-113
Channel assignment and weighted coloring
Colin McDiarmid
,
Bruce Reed
Networks
36
(2), 2000, pp. 114-117
Equivalent nondegenerate L-shapes of double-loop networks
Chiuyuan Chen
,
F.K. Hwang
Networks
36
(2), 2000, pp. 118-125
Compounding of gossip graphs
Guillaume Fertin
,
Roger Labahn
Networks
36
(2), 2000, pp. 126-137
Tabu search for the Steiner poblem in graphs
Celso C. Ribeiro
,
Maurício C. De Souza
Networks
36
(2), 2000, pp. 138-146
Minimum-diameter covering problems
Esther M. Arkin
,
Refael Hassin
Networks
36
(3), 2000, pp. 147-155
The graph Voronoi diagram with applications
Martin Erwig
Networks
36
(3), 2000, pp. 156-163
On the unilateral
(\Delta, D^*)
-problem
José Gómez
,
Eduardo A. Canale
,
Xavier Muñoz
Networks
36
(3), 2000, pp. 164-171
Approximating multiroot 3-outconnected subgraphs
Zeev Nutov
Networks
36
(3), 2000, pp. 172-179
Fault-tolerant routings in chordal ring networks
Lali Barrière
,
Josep Fàbrega
,
Ester Simó
,
Marisa Zaragozá
Networks
36
(3), 2000, pp. 180-190
Low-congested interval routing schemes for hypercubelike networks
Serafino Cicerone
,
Gabriele Di Stefano
,
M. Flammini
Networks
36
(3), 2000, pp. 191-201
The full-degree spanning tree problem
Randeep Bhatia
,
Samir Khuller
,
Robert Pless
,
Yoram J. Sussmann
Networks
36
(4), 2000, pp. 203-209
Topological expansion of multiple-ring metropolitan area networks
Steven Chamberland
,
Brunilde Sansò
Networks
36
(4), 2000, pp. 210-224
Hamiltonian-laceability of star graphs
Sun-Yuan Hsieh
,
Gen-Huey Chen
,
Chin-Wen Ho
Networks
36
(4), 2000, pp. 225-232
Seiten 1
2
3
>