Network Design: Connectivity and Facilities Location

4 papers1 directions
Network Design: Connectivity and Facilities Location was a research venue active in 1997 that focused on the intersection of combinatorial optimization, graph theory, and geometric algorithms. The venue provided a platform for presenting theoretical advancements in network topology and infrastructure planning. Its contributions primarily addressed the mathematical foundations of how networks are structured and improved to meet specific service constraints or efficiency goals. The research published at this venue included work on approximation schemes for geometric problems, such as the Euclidean Traveling Salesperson Problem (TSP), and algorithms for wavelength allocation in directed tree networks. Other significant topics included network improvement problems and service-constrained design. These papers explored the complexity of finding optimal or near-optimal solutions for large-scale connectivity challenges, which are foundational to various fields within computer science and operations research. Notable contributors to the venue included researchers such as Madhav V. Marathe, R. Ravi, Sanjeev Arora, and Hartmut Noltemeier. While its active period in the available record is limited to 1997, the venue's focus on algorithmic efficiency and network optimization reflects a specific niche in the landscape of computational research. The work presented here contributed to the development of greedy algorithms and linear-time approximation schemes that remain relevant to the study of spatial data and network-based systems in artificial intelligence and machine learning.

Papers by Year

1997 4
1995 1

Top Research Directions

Research directions most represented by papers from this venue.

Parametric Search for Geometric Optimization 1

Top Authors

AuthorPapers
Madhav Marathe2
Giuseppe Persiano1
Ravi Sundaram1
Sanjeev Arora1
S. S. Ravi1
Sven O. Krumke1

Papers

TitleYear
An optimal greedy algorithm for wavelength allocation in directed tree networks1997
Improved results on service-constrained network design problems1997
Nearly linear time approximation schemes for Euclidean TSP and other geometric problems1997
Network improvement problems1997