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=24
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Locating an obnoxious facility on a Euclidean network to minimize neighborhood damage
Chang Sup Sung
,
Cheol Min Joo
Networks
24
(1), 1994, pp. 1-9
Weighted
k
-cardinality trees: Complexity and polyhedral structure
Matteo Fischetti
,
Horst W. Hamacher
,
Kurt Jrnsten
,
Francesco Maffioli
Networks
24
(1), 1994, pp. 11-21
A new characterization of tree medians with applications to distributed sorting
O. Gerstel
,
S. Zaks
Networks
24
(1), 1994, pp. 23-29
Improving the location of minimax facilities through network modification
Oded Berman
,
Divinagracia I. Ingco
,
Amedeo Odoni
Networks
24
(1), 1994, pp. 31-41
Use of continuous approximations within discrete algorithms for routing vehicles: Experimental results and interpretation
Randolph W. Hall
,
Yafeng Du
,
Julia Lin
Networks
24
(1), 1994, pp. 43-56
A fast algorithm for bounded generalized processing networks
J. David Fuller
,
B. Lan
Networks
24
(2), 1994, pp. 57-67
An efficient graph planarization two phase heuristic
Olivier Goldschmidt
,
Alexan Takvorian
Networks
24
(2), 1994, pp. 69-73
Forwarding indices of consistent routings and their complexity
M.C. Heydemann
,
J.C. Meyer
,
D. Sotteau
,
J. Opatrny
Networks
24
(2), 1994, pp. 75-82
Universal minimal total dominating functions in graphs
E.J. Cockayne
,
C.M. Mynhardt
,
Bo Yu
Networks
24
(2), 1994, pp. 83-90
Sharper analysis of packet routing on a butterfly
Arvind Krishna
,
Bruce Hajek
,
Andrea Pietracaprina
Networks
24
(2), 1994, pp. 91-101
Minimal-distance routing for KYKLOS II
Ding-Zhu Du
,
F.K. Hwang
,
A.M. Odlyzko
,
Yanjung Zhang
Networks
24
(2), 1994, pp. 103-108
Edge-maximal triangulated subgraphs and heuristics for the maximum clique problem
Jue Xue
Networks
24
(2), 1994, pp. 109-120
Local bipartite Turán graphs and graph partitioning
Jon Lee
,
Jennifer Ryan
Networks
24
(3), 1994, pp. 131-145
Probabilistic analysis of an enhanced partitioning algorithm for the Steiner tree problem in
R^d
Konstantinos Kalpakis
,
Alan T. Sherman
Networks
24
(3), 1994, pp. 147-159
Stochastic programs over trees with random arc capacities
Warren B. Powell
,
Raymond K. Cheung
Networks
24
(3), 1994, pp. 161-175
Mengerian properties, Hamiltonicity, and claw-free graphs
E. Flandrin
,
H. Li
Networks
24
(3), 1994, pp. 177-183
A separation decomposition for orders
Thomas Kämpke
Networks
24
(3), 1994, pp. 185-194
A degree sequence problem related to network design
Daniel Bienstock
,
Oktay Günlük
Networks
24
(4), 1994, pp. 195-205
Measures of vulnerability - The integrity family
Wayne Goddard
Networks
24
(4), 1994, pp. 207-213
A Delaunay triangulation-based heuristic for the Euclidean Steiner problem
J.E. Beasley
,
F. Goffinet
Networks
24
(4), 1994, pp. 215-224
On super
i
-connected graphs
James W. Boland
,
Richard D. Ringeisen
Networks
24
(4), 1994, pp. 225-232
Spanners in graphs of bounded degree
Leizhen Cai
,
Mark Keil
Networks
24
(4), 1994, pp. 233-249
On reliability of graphs with node failures
Olivier Goldschmidt
,
Patrick Jaillet
,
Richard LaSota
Networks
24
(4), 1994, pp. 251-259
Note: The diameter of edge domination critical graphs
Matteo Paris
Networks
24
(4), 1994, pp. 261-262
Note: Small integral flows need only sparse networks
Ingo Althöfer
Networks
24
(4), 1994, pp. 263-266
Seiten 1
2
>