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=40
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Parallel
NC
-algorithms for multifacility location problems with mutual communication and their applications
Igor Averbakh
,
Oded Berman
Networks
40
(1), 2002, pp. 1-12
A branch-and-price algorithm for switch-box routing
David Grove Jrgensen
,
Morten Meyling
Networks
40
(1), 2002, pp. 13-26
A note on the Traveling Repairman problem
Alfredo García
,
Pedro Jodrá
,
Javier Tejel
Networks
40
(1), 2002, pp. 27-31
Approximation algorithms for constructing wavelength
Refael Hassin
,
Asaf Levin
Networks
40
(1), 2002, pp. 32-37
Preprocessing Steiner Problems from VLSI layout
Eduardo Uchoa
,
Marcus Poggi de Aragão
,
Celso C. Ribeiro
Networks
40
(1), 2002, pp. 38-50
Embedding iterated line digraphs in books
Toru Hasunuma
Networks
40
(2), 2002, pp. 51-62
Source location problems considering vertex-connectivity and edge-connectivity simultaneously
Hiro Ito
,
Motoyasu Ito
,
Yuichiro Itatsu
,
Kazuhiro Nakai
,
Hideyuki Uehara
,
Mitsuo Yokoyama
Networks
40
(2), 2002, pp. 63-70
Augmented cubes
S.A. Choudum
,
V. Sunitha
Networks
40
(2), 2002, pp. 71-84
Fast permutation routing in a class of interconnection networks
Ehab S. Elmallah
,
Chin-Hung Lam
Networks
40
(2), 2002, pp. 85-90
Super edge- and point-connectivities of the Cartesian product of regular graphs
Bih-Sheue Shieh
Networks
40
(2), 2002, pp. 91-96
Shortest-path network interdiction
Eitan Israeli
,
R. Kevin Wood
Networks
40
(2), 2002, pp. 97-111
Minimax problems with bitonic matrices
Dorit S. Hochbaum
,
Paul A. Tucker
Networks
40
(3), 2002, pp. 113-124
Network fair bandwidth share using hash rate estimation
Jung-Shian Li
,
Ming-Shiann Leu
Networks
40
(3), 2002, pp. 125-141
Node-disjoint paths and related problems on hierarchical cubic networks
Jung-Sheng Fu
,
Gen-Huey Chen
,
Dyi-Rong Duh
Networks
40
(3), 2002, pp. 142-154
Isomorphisms of the de Bruijn digraph and free-space optical networks
D. Coudert
,
A. Ferreira
,
S. Perennes
Networks
40
(3), 2002, pp. 155-164
Increasing the connectivity of the star graphs
Eddie Cheng
,
Marc J. Lipman
Networks
40
(3), 2002, pp. 165-169
Solving partial constraint satisfaction problems with tree decomposition
Arie M.C.A. Koster
,
Stan P.M. van Hoessel
,
Antoon W.J. Kolen
Networks
40
(3), 2002, pp. 170-180
Combinatorial algorithms for inverse network flow problems
Ravindra K. Ahuja
,
James B. Orlin
Networks
40
(4), 2002, pp. 181-187
Multistars and directed flow formulations
Luis Gouveia
,
Leslie Hall
Networks
40
(4), 2002, pp. 188-201
Design of fault-tolerant networks for satellites (TWTA redundancy)
Jean-Claude Bermond
,
Eric Darrot
,
Olivier Delmas
Networks
40
(4), 2002, pp. 202-207
Efficient algorithms for finding the
(k,l)
-core of tree networks
Ronald I. Becker
,
Isabella Lari
,
Giovanni Storchi
,
Andrea Scozzari
Networks
40
(4), 2002, pp. 208-215
On the online shortest path problem with limited arc cost dependencies
S. Travis Waller
,
Athanasios K. Ziliaskopoulos
Networks
40
(4), 2002, pp. 216-227
The fractional matching numbers of graphs
Yan Liu
,
Guizhen Liu
Networks
40
(4), 2002, pp. 228-231