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=43
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Branch decompositions and minor containment
Illya V. Hicks
Networks
43
(1), 2004, pp. 1-9
Connectivity-splitting models for survivable network design
Anantaram Balakrishnan
,
Thomas L. Magnanti
,
Prakash Mirchandani
Networks
43
(1), 2004, pp. 10-27
Fault-tolerant cycle embedding in hierarchical cubic networks
Jung-Sheng Fu
,
Gen-Huey Chen
Networks
43
(1), 2004, pp. 28-38
Optimization of Internet Protocol network design and routing
Kaj Holmberg
,
Di Yuan
Networks
43
(1), 2004, pp. 39-53
Edge-superconnectivity of cages
X. Marcote
,
C. Balbuena
Networks
43
(1), 2004, pp. 54-59
Minimal path broadcast networks
Arthur M. Farley
Networks
43
(2), 2004, pp. 61-70
The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
Corinne Feremans
,
Martine Labbé
,
Gilbert Laporte
Networks
43
(2), 2004, pp. 71-86
An exact algorithm for the min-cost network containment problem
Raffaele Pesenti
,
Franca Rinaldi
,
Walter Ukovich
Networks
43
(2), 2004, pp. 87-102
On some properties of suboptimal colorings of graphs
Ivo Blöchliger
,
D. de Werra
Networks
43
(2), 2004, pp. 103-108
The absolute center of a network
Dov Dvir
,
Gabriel Y. Handler
Networks
43
(2), 2004, pp. 109-118
A randomized algorithm for gossiping in radio networks
Marek Chrobak
,
Leszek Ga̧sieniec
,
Wojciech Rytter
Networks
43
(2), 2004, pp. 119-124
A hybrid multicommodity routing algorithm for traffic engineering
Wided Ouaja
,
Barry Richards
Networks
43
(3), 2004, pp. 125-140
Bisectored unit disk graphs
John Nolan
Networks
43
(3), 2004, pp. 141-152
Minimum-cost dynamic flows: The series-parallel case
Bettina Klinz
,
Gerhard J. Woeginger
Networks
43
(3), 2004, pp. 153-162
Low-connectivity network design on series-parallel graphs
S. Raghavan
Networks
43
(3), 2004, pp. 163-176
The Ring Star Problem: Polyhedral analysis and exact algorithm
Martine Labbé
,
Gilbert Laporte
,
Inmaculada Rodríguez Martín
,
Juan José Salazar González
Networks
43
(3), 2004, pp. 177-189
The 2-path network problem
Geir Dahl
,
Bjarne Johannessen
Networks
43
(3), 2004, pp. 190-199
A directed cycle-based column-and-cut generation method for capacitated survivable network design
Deepak Rajan
,
Alper Atamtürk
Networks
43
(4), 2004, pp. 201-211
The maximum-leaf spanning tree problem: Formulations and facets
Tetsuya Fujie
Networks
43
(4), 2004, pp. 212-223
A note on a secure voting system on a public network
M.G. Karagiannopoulos
,
M.N. Vrahatis
,
G.C. Meletiou
Networks
43
(4), 2004, pp. 224-225
Minimizing beam-on time in cancer radiation treatment using multileaf collimators
Natashia Boland
,
Horst W. Hamacher
,
Frank Lenzen
Networks
43
(4), 2004, pp. 226-240
Large-scale local search heuristics for the capacitated vertex
\p
-center problem
Maria Paola Scaparra
,
Stefano Pallottino
,
Maria Grazia Scutellà
Networks
43
(4), 2004, pp. 241-255
Algorithms for a network design problem with crossing supermodular demands
Vardges Melkonian
,
Éva Tardos
Networks
43
(4), 2004, pp. 256-265
Complete binary trees in folded and enhanced cubes
S.A. Choudum
,
R. Usha Nandini
Networks
43
(4), 2004, pp. 266-272