A constant factor approximation for the single sink edge installation problem

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2001, Pages 383-388

  Guha, Sudipto ^a   Meyerson, Adam ^a   Munagala, Kamesh ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; PROBLEM SOLVING; TREES (MATHEMATICS);

NETWORK DESIGN PROBLEMS;

LOGIC CIRCUITS;

EID: 0034832008     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. The access network design problem
2. Buy-at-bulk network design
3. Cost-sensitive analysis of communication protocols
4. Probabilistic approximation of metric spaces and its algorithmic applications
5. On approximating arbitrary metrics by tree metrics
6. Rounding via trees: Deterministic approximation algorithms for group Steiner trees and k-median
7. Approximating a finite metric by a small number of tree metrics
8. On the integrality gap of a natural formulation of the single-sink buy-at-bulk network design problem
9. Hierarchical placement and network design problems
10. Building Steiner trees with incomplete global knowledge
11. Balancing minimum spanning and shortest path trees
12. Cost-Distance: Two metric network design
13. Buy-at-bulk network design: Approximating the single-sink edge installation problem