Approximating the Single-Sink Link-Installation Problem in Network Design

@article{Salman2000ApproximatingTS,
  title={Approximating the Single-Sink Link-Installation Problem in Network Design},
  author={F. Sibel Salman and Joseph Cheriyan and R. Ravi and S. Subramanian},
  journal={SIAM Journal on Optimization},
  year={2000},
  volume={11},
  pages={595-610}
}
We initiate the algorithmic study of an important but NP-hard problem that arises commonly in network design. The input consists of the following: An undirected graph with one sink node and multiple source nodes, a specified length for each edge, and a specified demand, demv, for each source node v. A small set of cable types, where each cable type is specified by its capacity and its cost per unit length. The cost per unit capacity per unit length of a high-capacity cable may be significantly… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 56 CITATIONS

Approximation Algorithms for Buy-at-Bulk Geometric Network Design

VIEW 7 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Middle-mile Network Optimization in Rural Wireless Meshes

VIEW 1 EXCERPT

Exact Approaches for Designing Multifacility Buy-at-Bulk Networks

VIEW 2 EXCERPTS
CITES BACKGROUND

FILTER CITATIONS BY YEAR

2001
2020

CITATION STATISTICS

  • 2 Highly Influenced Citations

References

Publications referenced by this paper.
SHOWING 1-10 OF 32 REFERENCES