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=2001
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Characterizing the bit permutation networks obtained from the line digraphs of bit permutation networks
Frank K. Hwang
,
Chih-Hung Yen
Networks
38
(1), 2001, pp. 1-5
An algorithm for constructing minimal
c
-broadcast networks
Shiwoo Lee
,
José A. Ventura
Networks
38
(1), 2001, pp. 6-21
Electronic voting in a large-scale distributed system
Gianluca Dini
Networks
38
(1), 2001, pp. 22-32
The ultracenter and central fringe of a graph
Gary Chartrand
,
Karen S. Novotny
,
Steven J. Winters
Networks
38
(1), 2001, pp. 33-38
Efficient communication in unknown networks
Luisa Gargano
,
Andrzej Pelc
,
Stéphane Pérennes
,
Ugo Vaccaro
Networks
38
(1), 2001, pp. 39-49
Local search with perturbations for the prize-collecting Steiner tree problem in graphs
S.A. Canuto
,
M.G.C. Resende
,
C.C. Ribeiro
Networks
38
(1), 2001, pp. 50-58
On the Traveling Salesman problem restricted to inputs satisfying a relaxed triangle inequality
Thomas Andreae
Networks
38
(2), 2001, pp. 59-67
A polynomial algorithm for a constrained Traveling Salesman problem
J.H. Rubinstein
,
D.A. Thomas
,
N.C. Wormald
Networks
38
(2), 2001, pp. 68-75
A catalog of Hanan grid problems
Martin Zachariasen
Networks
38
(2), 2001, pp. 76-83
The center function on trees
F.R. McMorris
,
Fred S. Roberts
,
Chi Wang
Networks
38
(2), 2001, pp. 84-87
Solving the minimum-weighted coloring problem
Massimiliano Caramia
,
Paolo Dell'Olmo
Networks
38
(2), 2001, pp. 88-101
Robust location problems with pos/neg weights on a tree
Rainer E. Burkard
,
Helidon Dollani
Networks
38
(2), 2001, pp. 102-113
Universally maximum flow with piecewise-constant capacities
Lisa K. Fleischer
Networks
38
(3), 2001, pp. 115-125
Worst-case ratios of networks in the rectilinear plane
Ulrich Brenner
,
Jens Vygen
Networks
38
(3), 2001, pp. 126-139
File distribution in networks with multimedia storage servers
Jeong-dong Ryoo
,
Shivendra S. Panwar
Networks
38
(3), 2001, pp. 140-149
Minimum linear gossip graphs and maximal linear
(\Delta, k)
-gossip graphs
Pierre Fraigniaud
,
Joseph G. Peters
Networks
38
(3), 2001, pp. 150-162
k
-broadcasting in trees
Hovhannnes A. Harutyunyan
,
Arthur L. Liestman
Networks
38
(3), 2001, pp. 163-168
A network based model of a promotion-sensitive grocery logistics system
Ananth V. Iyer
,
Jianming Ye
Networks
38
(4), 2001, pp. 169-180
Solving the undirected multicommodity flow problem using a shortest path-based pricing algorithm
Richard D. McBride
,
John W. Mamer
Networks
38
(4), 2001, pp. 181-188
Low-cost minimum-time line-broadcasting schemes in complete binary trees
A. Averbuch
,
I. Gaber
,
Y. Roditty
Networks
38
(4), 2001, pp. 189-193
Maximizing residual flow under an arc destruction
Y.P. Aneja
,
R. Chandrasekaran
,
K.P.K. Nair
Networks
38
(4), 2001, pp. 194-198
Area efficient layouts of the batcher sorting networks
Shimon Even
Networks
38
(4), 2001, pp. 199-208
The clique partitioning problem: facets and tatching facets
Maarten Oosten
,
Jeroen H.G.C. Rutten
,
Frits C.R. Spieksma
Networks
38
(4), 2001, pp. 209-226
The early days of Networks
Ivan T. Frisch
Networks
37
(1), 2001, pp. 1-7
An improved approximation scheme for the group Steiner problem
C.S. Helvig
,
Gabriel Robins
,
Alexander Zelikovsky
Networks
37
(1), 2001, pp. 8-20
Seiten 1
2
>