Network Design: Connectivity and Facilities Location 1997

4 papers
The 1997 edition of Network Design: Connectivity and Facilities Location comprised six papers centered on algorithmic optimization and infrastructure efficiency. A primary research direction involved the development of approximation schemes for geometric problems, specifically the Euclidean Traveling Salesperson Problem, with an emphasis on achieving nearly linear time complexity. Additional studies focused on network improvement problems and service-constrained design, addressing how to optimize network structures under specific operational requirements. The proceedings also explored specialized connectivity issues, such as wavelength allocation in directed tree networks using greedy algorithms. Notable contributors included Madhav V. Marathe, R. Ravi, S. S. Ravi, and Sanjeev Arora. The research presented during this year reflects a trend toward refining theoretical bounds and improving the computational efficiency of solutions for complex network design and facility location tasks.

Top Research Directions

The 1 research directions with Network Design: Connectivity and Facilities Location 1997 papers, ranked by paper count. Share is the fraction of the edition’s papers in the direction.

#DirectionPapersShare
1Parametric Search for Geometric Optimization125.0%

Download all directions as CSV

Institutions

Institutions credited by Network Design: Connectivity and Facilities Location 1997 papers: a paper credits every institution named in its affiliations, once. 3 institutions share 1 credited papers.

#InstitutionPapersShare19951995 rank
1Los Alamos National Laboratory 1100.0%13
2United States Department of Energy 1100.0%12
3University of California System 1100.0%11

Download all institutions as CSV

About this data

Papers. Network Design: Connectivity and Facilities Location 1997 lists 4 papers on Lacuna, duplicate versions counted once; rejected and withdrawn submissions are left out.

Directions. Directions are Lacuna’s clustering of the concept elements extracted from each paper, so a paper can belong to several and direction counts add up to more than the paper count. A direction’s share is its papers divided by the edition’s papers.

Institutions. A paper credits each institution named in its affiliations, resolved to a ROR record, once. 1 of 4 papers (25.0%) credit at least one institution and are the base for institution shares; the rest have no resolved affiliation yet.

Data. Counts come from Lacuna’s data build of 2026-11-19 and change as papers are added. Tables as CSV: directions · institutions. Cite as: Lacuna, “Network Design: Connectivity and Facilities Location 1997”, https://lacuna.tiptreesystems.com/venue/network-design-connectivity-and-facilities-location/1997.

Top Authors

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

Papers

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