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=1992
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The Steiner problem in the hypercube
Zevi Miller
,
Manley Perkel
Networks
22
(1), 1992, pp. 1-19
An optimal algorithm to solve the all-pair shortest path problem on interval graphs
R. Ravi
,
Madhav V. Marathe
,
C. Pandu Rangan
Networks
22
(1), 1992, pp. 21-35
Distance-constrained multifacility minimax location problems on tree networks
E. Erkut
,
R.L. Francis
,
A. Tamir
Networks
22
(1), 1992, pp. 37-54
Steiner tree problems
F.K. Hwang
,
Dana S. Richards
Networks
22
(1), 1992, pp. 55-89
The
N
-line traveling Salesman problem
Günter Rote
Networks
22
(1), 1992, pp. 91-108
On the optimal strongly connected orientations of city street graphs - Three east-west avenues or north-south streets
Fred S. Roberts
,
Yonghua Xu
Networks
22
(2), 1992, pp. 109-143
Finacial flow of funds networks
Anna Nagurney
,
Merritt Hughes
Networks
22
(2), 1992, pp. 145-161
Optimal routing and process scheduling for a mobile service facility
Umit Akinc
,
Kizhanatham Srikanth
Networks
22
(2), 1992, pp. 163-183
A routing algorithm for virtual curcuit data networks with multiple sessions per
O-D
pair
James R. Yee
,
Frank Y.S. Lin
Networks
22
(2), 1992, pp. 185-208
A reliability-improving graph transformation with applications to network reliability
A. Satyanarayana
,
L. Schoppmann
,
C.L. Suffel
Networks
22
(2), 1992, pp. 209-216
The generalized
P
-forest problem on a tree network
Arie Tamir
,
Timothy J. Lowe
Networks
22
(3), 1992, pp. 217-230
Location of facilities on a network subject to a single-edge failure
Horst A. Eiselt
,
Michel Gendreau
,
Gilbert Laporte
Networks
22
(3), 1992, pp. 231-246
Complexity results for well-covered graphs
Ramesh S. Sankaranarayana
,
Lorna K. Stewart
Networks
22
(3), 1992, pp. 247-262
Special cased of Traveling Salesman and repairman problems with time windows
John N. Tsitsiklis
Networks
22
(3), 1992, pp. 263-282
On a parametric shortest path problem from primal-dual multicommodity network optimization
George G. Polak
Networks
22
(3), 1992, pp. 283-295
The optimal partitioning of networks
Chung-Kuan Cheng
Networks
22
(3), 1992, pp. 297-315
Sequential information dissemniation by packets
A. Bagchi
,
E.F. Schmeichel
,
S.L. Hakimi
Networks
22
(4), 1992, pp. 317-333
Degenerate Gilbert-Steiner trees
J.F. Weng
Networks
22
(4), 1992, pp. 335-348
Paths through a maze of rectangles
E.G., Jr. Coffman
,
E.N. Gilbert
Networks
22
(4), 1992, pp. 349-367
Algorithms for
K
-terminal reliability problems with node failures
Ehab S. Elmallah
Networks
22
(4), 1992, pp. 369-384
Two algorithms for the subset interconnection design problem
Erich Prisner
Networks
22
(4), 1992, pp. 385-395
Cell suppression: Disclosure protection for sensitive tabular data
James P. Kelly
,
Bruce L. Golden
,
Arjang A. Assad
Networks
22
(4), 1992, pp. 397-417
The swapping problem
S. Anily
,
R. Hassin
Networks
22
(4), 1992, pp. 419-433
On a leverage problem in the hypercube
Peter Hamburger
,
Raymond E. Pippert
,
W. Douglas Weakley
Networks
22
(5), 1992, pp. 435-439
Reliable communication in networks with Byzantine link failures
Andrzej Pelc
Networks
22
(5), 1992, pp. 441-459
Seiten 1
2
>