Network design for information networks

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2005, Pages 933-942

  Hayrapetyan, Ara ^a   Swamy, Chaitanya ^a   Tardos, Éva ^a  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION AGGREGATION; INFORMATION NETWORKS; NETWORK DESIGN; STOCHASTIC OPTIMIZATION PROBLEMS;

ALGORITHMS; APPROXIMATION THEORY; INFORMATION ANALYSIS; MATHEMATICAL MODELS; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; SET THEORY; STOCHASTIC PROGRAMMING;

COMPUTER NETWORKS;

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

References (16)

1. A. Agrawal, P. Klein, and R. Ravi. When trees collide: an approximation algorithm for the generalized Steiner problem on networks. SIAM J. Computing, 24(3):440-456, 1995.
2. B. Awerbuch and Y. Azar. Buy-at-bulk network design. In Proceedings of 38th FOCS, pages 542-547, 1997.
3. A. Campailla, S. Chaki, E. Clarke, S. Jha, and H. Veith. Efficient filtering in publish-subscribe systems using binary decision diagrams. In Proc. 23rd ICSE, pages 443-452, 2001.
4. J. Fakcharoenphol, S. Rao, and K. Talwar. A tight bound on approximating arbitrary metrics by tree metrics. In Proceedings of 35th STOC, pages 448-455, 2003.
5. A. Goel and D. Estrin. Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk. In Proceedings of 14th SODA, pages 499-505, 2003.
6. M. X. Goemans and D. P. Williamson. A general approximation technique for constrained forest problems. SIAM J. Computing, 24:296-317, 1995.
7. A. Gupta, A. Kumar, M. Pal, and T. Roughgarden. Approximation via cost sharing: a simple approximation algorithm for the multicommodity rent-or-buy problem. In Proceedings of 44th FOCS, pages 605-615, 2003.
8. A. Gupta, M. Pál, R. Ravi, & A. Sinha. Boosted sampling: approximation algorithms for stochastic optimization. In Proceedings of 36th STOC, pages 417-426, 2004.
9. A. Gupta, R. Ravi, & A. Sinha. An edge in time saves nine: LP rounding approximation algorithms. FOCS, 2004.
10. K. Jain and V. V. Vazirani. Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation. Journal of the ACM, 48(2):274-296, 2001.
11. D. R. Karger and M. Minkoff. Building Steiner trees with incomplete global knowledge. In Proceedings of 41st FOCS, pages 613-623, 2000.
12. R. Ravi and A. Sinha. Integrated logistics: approximation algorithms combining facility location and network design. In Proceedings of 9th IPCO, pages 212-229, 2002.
13. R. Ravi and A. Sinha. Multicommodity facility location. In Proceedings of 15th SODA, pages 335-342, 2004.
14. D. B. Shmoys and C. Swamy. Stochastic optimization is (almost) as easy as deterministic optimization. FOCS, 2004.
15. D. B. Shmoys, C. Swamy, and R. Levi. Facility location with service installation costs. In Proceedings of 15th SODA, pages 1081-1090, 2004.
16. C. Swamy and A. Kumar. Primal-dual algorithms for connected facility location problems. Algorithmica, 40(4):245-269, 2004.