Networks, Volume 40

Volume 40, Number 1, August 2002

Igor Averbakh, Oded Berman:
Parallel NC-algorithms for multifacility location problems with mutual communication and their applications. 1-12
David Grove Jørgensen, Morten Meyling:
A branch-and-price algorithm for switch-box routing. 13-26
Alfredo García Olaverri, Pedro Jodrá, Javier Tejel:
A note on the traveling repairman problem. 27-31
Refael Hassin, Asaf Levin:
Approximation algorithms for constructing wavelength routing networks. 32-37
Eduardo Uchoa, Marcus Poggi de Aragão, Celso C. Ribeiro:
Preprocessing Steiner problems from VLSI layout. 38-50

Toru Hasunuma:
Embedding iterated line digraphs in books. 51-62
Hiro Ito, Motoyasu Ito, Yuichiro Itatsu, Kazuhiro Nakai, Hideyuki Uehara, Mitsuo Yokoyama:
Source location problems considering vertex-connectivity and edge-connectivity simultaneously. 63-70
Sheshayya A. Choudum, V. Sunitha:
Augmented cubes. 71-84
Ehab S. Elmallah, Chin-Hung Lam:
Fast permutation routing in a class of interconnection networks. 85-90
Bih-Sheue Shieh:
Super edge- and point-connectivities of the Cartesian product of regular graphs. 91-96
Eitan Israeli, R. Kevin Wood:
Shortest-path network interdiction. 97-111

Dorit S. Hochbaum, Paul A. Tucker:
Minimax problems with bitonic matrices. 113-124
Jung-Shian Li, Ming-Shiann Leu:
Network fair bandwidth share using hash rate estimation. 125-141
Jung-Sheng Fu, Gen-Huey Chen, Dyi-Rong Duh:
Node-disjoint paths and related problems on hierarchical cubic networks. 142-154
David Coudert, Afonso Ferreira, Stephane Perennes:
Isomorphisms of the De Bruijn digraph and free-space optical networks. 155-164
Eddie Cheng, Marc J. Lipman:
Increasing the connectivity of the star graphs. 165-169
Arie M. C. A. Koster, Stan P. M. van Hoesel, Antoon W. J. Kolen:
Solving partial constraint satisfaction problems with tree decomposition. 170-180

Ravindra K. Ahuja, James B. Orlin:
Combinatorial algorithms for inverse network flow problems. 181-187
Luis Gouveia, Leslie A. Hall:
Multistars and directed flow formulations. 188-201
Jean-Claude Bermond, Éric Darrot, Olivier Delmas:
Design of fault-tolerant networks for satellites (TWTA redundancy). 202-207
Ronald I. Becker, Isabella Lari, Giovanni Storchi, Andrea Scozzari:
Efficient algorithms for finding the (k, l)-core of tree networks. 208-215
S. Travis Waller, Athanasios K. Ziliaskopoulos:
On the online shortest path problem with limited arc cost dependencies. 216-227
Yan Liu, Guizhen Liu:
The fractional matching numbers of graphs. 228-231

Last update Tue Feb 14 04:21:45 2012 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page