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=1999
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Deferrred-query: An efficient approach for some problems on interval graphs
Maw-Shang Chang
,
Sheng-Lung Peng
,
Jenn-Liang Liaw
Networks
34
(1), 1999, pp. 1-10
On the memory overhead of distributed snapshots
Lior Shabtay
,
Adrian Segall
Networks
34
(1), 1999, pp. 11-17
Path problems in networks with vector-valued edge weights
Giri K. Tayi
,
Daniel J. Rosenkrantz
,
S.S. Ravi
Networks
34
(1), 1999, pp. 19-35
Lower bounds for linear interval routing
T. Eilam
,
S. Moran
,
S. Zaks
Networks
34
(1), 1999, pp. 37-46
Deadlock-free interval routing schemes
Michele Flammini
Networks
34
(1), 1999, pp. 47-60
Optimal edge coloring of large graphs
J. Gómez
,
M. Escudero
Networks
34
(1), 1999, pp. 61-65
An optimal algorithm for layered wheel floorplan designs
Priyalal Kulasinghe
,
Saïd Bettayeb
Networks
34
(1), 1999, pp. 67-72
A competitive analysis for retransmission timeout
Shlomi Dolev
,
Michael Kate
,
Jennifer L. Welch
Networks
34
(1), 1999, pp. 73-80
Optimal tree 3-spanners in directed path graphs
Hoàng-Oanh Le
,
Van Bang Le
Networks
34
(2), 1999, pp. 81-87
An efficient implementation of an algorithm for finding
K
shortest simple paths
E. Hadjiconstantinou
,
N. Christofides
Networks
34
(2), 1999, pp. 88-101
Analysis of
LP
relaxations for multiway and multicut problems
Dimitris Bertsimas
,
Chung-Piaw Teo
,
Rakesh Vohra
Networks
34
(2), 1999, pp. 102-114
Eccentric graphs
Gary Chartrand
,
Weizhen Gu
,
Michelle Schultz
,
Steven J. Winters
Networks
34
(2), 1999, pp. 115-121
Optimum requirement spanning trees and reliability of tree networks
Tsutomu Anazawa
,
Takayuki Kodera
,
Masakazu Jimbo
Networks
34
(2), 1999, pp. 122-131
On a condition for obtaining an explicit solution of optimum requirement spanning tree
Tsutomu Anazawa
Networks
34
(2), 1999, pp. 132-135
Greedy online algorithms for routing permanent virtual circuits
Jessen T. Havill
,
Weizhen Mao
Networks
34
(2), 1999, pp. 136-153
New large graphs with given degree and diameter six
J. Gómez
,
I. Pelayo
,
C. Balbuena
Networks
34
(2), 1999, pp. 154-161
A tabu search heuristic for the Steiner tree problem
Michel Gendreau
,
Jean-Francois Larochelle
,
Brunilde Sansò
Networks
34
(2), 1999, pp. 162-172
On crossings, the Crossing Postman problem, and the Rural Postman problem
Robert S. Garfinkel
,
Ian R. Webb
Networks
34
(3), 1999, pp. 173-180
The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs
Cees Duin
,
Stefan Voss̈
Networks
34
(3), 1999, pp. 181-191
Tenacity of complete graph products and grids
S.A. Choudum
,
N. Priya
Networks
34
(3), 1999, pp. 192-196
On the superconnectivity and the conditional diameter of graphs and digraphs
A. Carmona
,
J. Fàbrega
Networks
34
(3), 1999, pp. 197-205
Optimal adaptive fault diagnosis for simple multiprocessor systems
Evangelos Kranakis
,
Andrzej Pelc
,
Anthony Spatharis
Networks
34
(3), 1999, pp. 206-214
Crossing properties of multiterminal cuts
Robert F. Easley
,
David Hartvigsen
Networks
34
(3), 1999, pp. 215-220
Modeling
K
-coteries by well-covered graphs
Masafumi Yamashita
,
Tsunehiko (Tiko) Kameda
Networks
34
(3), 1999, pp. 221-228
Heuristic and exact algorithms for scheduling aircraft landings
Andreas T. Ernst
,
Mohan Krishnamoorthy
,
Robert H. Storer
Networks
34
(3), 1999, pp. 229-241
Seiten 1
2
3
>