default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDIMACS Workshop: Network Design: Connectivity and Facilities Location 1997
- Panos M. Pardalos, Ding-Zhu Du:
Network Design: Connectivity and Facilities Location, Proceedings of a DIMACS Workshop, Princetin, New Jersey, USA, April 28-30, 1997. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 40, DIMACS/AMS 1998, ISBN 978-0-8218-0834-4 - Foreword. Network Design: Connectivity and Facilities Location 1997: xi-
- Preface. Network Design: Connectivity and Facilities Location 1997: xiii-
- Sanjeev Arora:
Nearly linear time approximation schemes for Euclidean TSP and other geometric problems. 1-2 - Roberto Battiti, Alan A. Bertossi:
Differential greedy for the 0-1 equicut problem. 3-21 - Marcus Brazil, Doreen A. Thomas, Jia F. Weng:
Gradient-constrained minimal Steiner trees. 23-38 - Sui-Wing Cheng:
The Steiner tree problem for terminals on the boundary of a rectilinear polygon. 39-57 - Dietmar Cieslik:
Using Hadwiger numbers in network design. 59-77 - Cees Duin:
Reducing the graphical Steiner problem with a sensitivity test. 79-107 - Andreas Eisenblätter:
A frequency assignment problem in cellular phone networks. 109-115 - Thomas Erlebach, Klaus Jansen, Christos Kaklamanis, Giuseppe Persiano:
An optimal greedy algorithm for wavelength allocation in directed tree networks. 117-129 - Kristina Holmqvist, Athanasios Migdalas, Panos M. Pardalos:
A GRASP algorithm for the single source uncapacitated minimum concave-cost network flow problem. 131-142 - Klaus Jansen:
Approximation results for the optimum cost chromatic partition problem. 143-168 - Marek Karpinski, Alexander Zelikovsky:
Approximating dense cases of covering problems. 169-178 - Sudipto Guha, Samir Khuller:
Connected facility location problems. 179-190 - Narsingh Deo, Nishit Kumar:
Constrained spanning tree problems: Approximate methods and parallel computation. 191-217 - Wu-Ji Li, James MacGregor Smith:
Star, grid, ring topologies in facility location & network design. 219-246 - Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi:
Network improvement problems. 247-268 - Madhav V. Marathe, R. Ravi, Ravi Sundaram:
Improved results on service-constrained network design problems. 269-276 - Robert A. Murphey, Panos M. Pardalos, Leonidas S. Pitsoulis:
A greedy randomized adaptive search procedure for the multitarget multisensor tracking problem. 277-301 - Warren B. Powell, Zhi-Long Chen:
A generalized threshold algorithm for the shortest path problem with time windows. 303-318 - José D. P. Rolim, Luca Trevisan:
A case study of de-randomization methods for combinatorial approximation algorithms. 319-334 - Stefan Voß, Kai Gutenschwager:
A chunking based genetic algorithm for the Steiner tree problem in graphs. 335-355 - David M. Warme:
A new exact algorithm for rectilinear Steiner trees. 357-395 - Peng-Jun Wan, Allalaghatta Pavan:
A scalable TWDM lightwave network based on generalized de Bruijn digraph. 397-414 - J. F. Weng:
A new model of generalized Steiner trees and 3-coordinate systems. 415-424 - Roland Wessäly:
A model for network design. 425-428 - Claire S. Adjiman, Carl A. Schweiger, Christodoulos A. Floudas:
Nonlinear and mixed-integer optimization in chemical process network systems. 429-452 - Marcus Brazil, J. Hyam Rubinstein, Doreen A. Thomas, Jia F. Weng, Nicholas C. Wormald:
Shortest networks on spheres. 453-461
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-03-08 00:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
