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=2005
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Design of survivable networks: A survey
Hervé Kerivin
,
A. Ridha Mahjoub
Networks
46
(1), 2005, pp. 1-21
Competitive routing in multicast communications
Thomas Boulogne
,
E. Altman
Networks
46
(1), 2005, pp. 22-35
A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing
L.S. Buriol
,
M.G.C. Resende
,
C.C. Ribeiro
,
M. Thorup
Networks
46
(1), 2005, pp. 36-56
An approximation algorithm for Stackelberg network pricing
Sébastien Roch
,
Gilles Savard
,
Patrice Marcotte
Networks
46
(1), 2005, pp. 57-67
On a routing and scheduling problem concerning multiple edge traversals in graphs
G.W. Groves
,
J. le Roux
,
J.H. van Vuuren
Networks
46
(2), 2005, pp. 69-81
On large
(\Delta, 6)
-graphs
J. Gómez Martí
Networks
46
(2), 2005, pp. 82-87
Reliable broadcasting in double loop networks
Nenad Obradović
,
Joseph Peters
,
Goran Ruz̑ić
Networks
46
(2), 2005, pp. 88-97
Near-shortest and
K
-shortest simple paths
W. Matthew Carlyle
,
R. Kevin Wood
Networks
46
(2), 2005, pp. 98-109
Mutually independent Hamiltonian paths in star networks
Cheng-Kuan Lin
,
Hua-Min Huang
,
Lih-Hsing Hsu
,
Sheng Bau
Networks
46
(2), 2005, pp. 110-117
Minimum path bases and relevant paths
Petra M. Gleiss
,
Josef Leydold
,
Peter F. Stadler
Networks
46
(3), 2005, pp. 119-123
Fixed-parameter tractability and data reduction for multicut in trees
Jiong Guo
,
Rolf Niedermeier
Networks
46
(3), 2005, pp. 124-135
Wide diameter and minimum length of disjoint Menger path systems
Toru Kojima
Networks
46
(3), 2005, pp. 136-141
Flexibility of Steiner trees in uniform orientation metrics
M. Brazil
,
P. Winter
,
M. Zachariasen
Networks
46
(3), 2005, pp. 142-153
Maximal vertex-connectivity of
\vec{S_{n,k}}
Eddie Cheng
,
William A. Lindsey
,
Daniel E. Steffy
Networks
46
(3), 2005, pp. 154-162
Nonblocking conditions of multicast three-stage interconnection networks
Achille Pattavina
,
Gino Tesei
Networks
46
(4), 2005, pp. 163-170
Equivalence of buddy networks with arbitrary number of stages
Chiuyuan Chen
,
Frank K. Hwang
,
James K. Lan
Networks
46
(4), 2005, pp. 171-176
Dynamic programming algorithms for the conditional covering problem on path and extended star graphs
Jennifer A. Horne
,
J. Cole Smith
Networks
46
(4), 2005, pp. 177-185
A dynamic programming algorithm for the conditional covering problem on tree graphs
Jennifer A. Horne
,
J. Cole Smith
Networks
46
(4), 2005, pp. 186-197
A branch-and-price approach for the maximum weight independent set problem
Deepak Warrier
,
Wilbert E. Wilhelm
,
Jeffrey S. Warren
,
Illya V. Hicks
Networks
46
(4), 2005, pp. 198-209
Solving the undirected minimum cost flow problem with arbitrary costs
A. Sedeño-Noda
,
C. González-Martín
,
S. Alonso
Networks
45
(1), 2005, pp. 1-3
Strict nonblockingness of reduced shuffle-exchange networks
F.K. Hwang
,
Binwu Zhang
Networks
45
(1), 2005, pp. 4-8
Parallel scheduling problems in next generation wireless networks
L. Becchetti
,
S. Leonardi
,
A. Marchetti-Spaccamela
,
A. Vitaletti
,
S. Diggavi
,
S. Muthukrishnan
,
T. Nandagopal
Networks
45
(1), 2005, pp. 9-22
Adversarial models for priority-based networks
C. Àlvarez
,
M. Blesa
,
J. Díaz
,
M. Serna
,
A. Fernández
Networks
45
(1), 2005, pp. 23-35
A network flow algorithm to minimize beam-on time for unconstrained multileaf collimator problems in cancer radiation therapy
Ravindra K. Ahuja
,
Horst W. Hamacher
Networks
45
(1), 2005, pp. 36-41
On the minimum number of wavelengths in multicast trees in WDM networks
Yingyu Wan
,
Weifa Liang
Networks
45
(1), 2005, pp. 42-48
Seiten 1
2
>