Network Design: Connectivity and Facilities Location, Proceedings of a DIMACS Workshop, Princetin, New Jersey, USA, April 28-30, 1997 - researchr publication

researchr

You are not signed in
Sign in
Sign up

Panos M. Pardalos, Ding-Zhu Du, editors, Network Design: Connectivity and Facilities Location, Proceedings of a DIMACS Workshop, Princetin, New Jersey, USA, April 28-30, 1997. Volume 40 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, DIMACS/AMS, 1998. [doi]

Conference: dimacs1998

Abstract is missing.

Nearly linear time approximation schemes for Euclidean TSP and other geometric problemsSanjeev Arora. 1-2

Differential greedy for the 0-1 equicut problemRoberto Battiti, Alan A. Bertossi. 3-22

Gradient-constrained minimal Steiner treesMarcus Brazil, Doreen A. Thomas, Jia F. Weng. 23-38

The Steiner tree problem for terminals on the boundary of a rectilinear polygonSui-Wing Cheng. 39-58

Using Hadwiger numbers in network designDietmar Cieslik. 59-78

Reducing the graphical Steiner problem with a sensitivity testCees Duin. 79-108

A frequency assignment problem in cellular phone networksAndreas Eisenblätter. 109-116

An optimal greedy algorithm for wavelength allocation in directed tree networksThomas Erlebach, Klaus Jansen, Christos Kaklamanis, Giuseppe Persiano. 117-130

A GRASP algorithm for the single source uncapacitated minimum concave-cost network flow problemKristina Holmqvist, Athanasios Migdalas, Panos M. Pardalos. 131-142

Approximation results for the optimum cost chromatic partition problemKlaus Jansen. 143-168

Approximating dense cases of covering problemsMarek Karpinski, Alexander Zelikovsky. 169-178

Connected facility location problemsSudipto Guha, Samir Khuller. 179-190

Constrained spanning tree problems: Approximate methods and parallel computationNarsingh Deo, Nishit Kumar. 191-218

Star, grid, ring topologies in facility location & network designWu-Ji Li, James MacGregor Smith. 219-246

Network improvement problemsSven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi 0001, S. S. Ravi. 247-268

A greedy randomized adaptive search procedure for the multitarget multisensor tracking problemRobert A. Murphey, Panos M. Pardalos, Leonidas S. Pitsoulis. 277-302

A generalized threshold algorithm for the shortest path problem with time windowsWarren B. Powell, Zhi-Long Chen. 303-318

A case study of de-randomization methods for combinatorial approximation algorithmsJosé D. P. Rolim, Luca Trevisan. 319-334

A chunking based genetic algorithm for the Steiner tree problem in graphsStefan Voß, Kai Gutenschwager. 335-356

A new exact algorithm for rectilinear Steiner treesDavid M. Warme. 357-396

A scalable TWDM lightwave network based on generalized de Bruijn digraphPeng-Jun Wan, Allalaghatta Pavan. 397-414

A new model of generalized Steiner trees and 3-coordinate systemsJ. F. Weng. 415-424

A model for network designRoland Wessäly. 425-428

Nonlinear and mixed-integer optimization in chemical process network systemsClaire S. Adjiman, Carl A. Schweiger, Christodoulos A. Floudas. 429-452

Shortest networks on spheresMarcus Brazil, J. Hyam Rubinstein, Doreen A. Thomas, Jia F. Weng, Nicholas C. Wormald. 453

runs on WebDSL