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=48
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Further contributions to network optimization
Walid Ben-Ameur
,
Luis Gouveia
Networks
48
(1), 2006, pp. 1-6
Route discovery with constant memory in oriented planar geometric networks
E. Chávez
,
S. Dobrev
,
E. Kranakis
,
J. Opatrny
,
L. Stacho
,
J. Urrutia
Networks
48
(1), 2006, pp. 7-15
A linear time algorithm for the reverse 1-median problem on a cycle
Rainer E. Burkard
,
Elisabeth Gassner
,
Johannes Hatzl
Networks
48
(1), 2006, pp. 16-23
The one-commodity pickup and delivery Travelling Salesman Problem on a path or a tree
Fan Wang
,
Andrew Lim
,
Zhou Xu
Networks
48
(1), 2006, pp. 24-35
A simple algorithm that proves half-integrality of bidirected network programming
Ethan D. Bolker
,
Thomas Zaslavsky
Networks
48
(1), 2006, pp. 36-38
Minimum cost flow-dependent communication networks
D.A. Thomas
,
J.F. Weng
Networks
48
(1), 2006, pp. 39-46
Fault-tolerant routings with minimum optical index
Jeffrey H. Dinitz
,
Alan Ling
,
Douglas R. Stinson
Networks
48
(1), 2006, pp. 47-55
The approach-dependent, time-dependent, label-constrained shortest path problem
Hanif D. Sherali
,
Chawalit Jeenanunta
,
Antoine G. Hobeika
Networks
48
(2), 2006, pp. 57-67
Flows on few paths: Algorithms and lower bounds
Maren Martens
,
Martin Skutella
Networks
48
(2), 2006, pp. 68-76
On extended formulations for the precedence constrained asymmetric Traveling Salesman Problem
L. Gouveia
,
P. Pesneau
Networks
48
(2), 2006, pp. 77-89
State-space partition techniques for multiterminal flows in stochastic networks
Matthew S. Daly
,
Christos Alexopoulos
Networks
48
(2), 2006, pp. 90-111
Reliability of interconnection networks modeled by a product of graphs
C. Balbuena
,
P. García-Vázquez
,
X. Marcote
Networks
48
(3), 2006, pp. 114-120
Hyper Hamiltonian laceability of Cayley graphs generated by transpositions
Toru Araki
Networks
48
(3), 2006, pp. 121-124
Solution methods for the
p
-median problem: An annotated bibliography
J. Reese
Networks
48
(3), 2006, pp. 125-142
Algorithms to calculate the distribution of the longest path length of a stochastic activity network with continuous activity durations
Lawrence M. Leemis
,
Matthew J. Duggan
,
John H. Drew
,
Jeffrey A. Mallozzi
,
Kerry W. Connell
Networks
48
(3), 2006, pp. 143-165
Collective tree exploration
Pierre Fraigniaud
,
Leszek Ga̧sieniec
,
Dariusz R. Kowalski
,
Andrzej Pelc
Networks
48
(3), 2006, pp. 166-177
An improved deniable authentication protocol
Jun Shao
,
Zhenfu Cao
,
Rongxing Lu
Networks
48
(4), 2006, pp. 179-181
The shortest path problem on large-scale real-road networks
G.A. Klunder
,
H.N. Post
Networks
48
(4), 2006, pp. 182-194
Solving minimum
k
-cardinality cut problems in planar graphs
Maurizio Bruglieri
,
Francesco Maffioli
,
Marco Trubian
Networks
48
(4), 2006, pp. 195-208
Extreme point characterizations for infinite network flow problems
H. Edwin Romeijn
,
Dushyant Sharma
,
Robert L. Smith
Networks
48
(4), 2006, pp. 209-222
Efficiency and fairness of system-optimal routing with user constraints
Andreas S. Schulz
,
Nicolás E. Stier-Moses
Networks
48
(4), 2006, pp. 223-234
On the spanning
w
-wide diameter of the star graph
Cheng-Kuan Lin
,
Hua-Min Huang
,
D. Frank Hsu
,
Lih-Hsing Hsu
Networks
48
(4), 2006, pp. 235-249