Universal approximations for TSP, Steiner Tree, and Set Cover

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2005, Pages 386-395

  Jia, Lujun ^a   Lin, Guolong ^a   Noubir, Guevara ^a   Rajaraman, Rajmohan ^a   Sundaram, Ravi ^a  

^a Northeastern University   (United States)

Author keywords

Approximation Algorithms; Set Cover; Sparse Partition; Steiner Tree; TSP; Universal Approximation

Indexed keywords

APPROXIMATION ALGORITHMS; SET COVER; SPARSE PARTITION; STEINER TREE; UNIVERSAL APPROXIMATION;

COMPUTATIONAL COMPLEXITY; INFORMATION ANALYSIS; METRIC SYSTEM; PROBLEM SOLVING; SET THEORY; TRAVELING SALESMAN PROBLEM; TREES (MATHEMATICS);

APPROXIMATION THEORY;

EID: 34848823150     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1060590.1060649     Document Type: Conference Paper

References (27)

1. http://www.mathcs.emory.edu/~mic/interests.html.
2. N. Alon and Y. Azar. On-line Steiner trees in the Euclidean plane. In Proceedings of the Eighth Annual ACM Symposium on Computational Geometry, pages 337-343, 1992.
3. B. Awerbuch and D. Peleg. Sparse partitions. In Proceedings of the Thirty-First IEEE Symposium on Foundations of Computer Science (FOCS), pages 503-513, 1990.
4. Y. Azar, E. Cohen, A. Fiat, H. Kaplan, and H. Racke. Optimal oblivious routing in polynomial time. In Proceedings of the Thirty-Fifth ACM Symposium on Theory of Computing (STOC), pages 383-388, 2003.
5. Y. Bartal. Probabilistic approximations of metric spaces and its algorithmic applications. In Proceedings of the Thirty-Seventh IEEE Symposium on Foundations of Computer Science (FOCS), pages 184-193, 1996.
6. Y. Bartal. On approximating arbitrary metrics by tree metrics. In Proceedings of the Thirtieth ACM Symposium on Theory of Computing (STOC), pages 161-168, 1998.
7. D. Bertsimas and M. Grigni. On the space-filling curve heuristic for the euclidean traveling salesman problem. Operations Research Letters, 8:241-244, October 1989.
8. A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, Cambridge, UK, 1998.
9. J. L. Carter and M. N. Wegman. Universal classes of hash functions. Journal of Computer Systems and Sciences (JCSS), 18:143-154, 1979.
10. B. Dean, M. Goemans, and J. Vondrak. Approximating the stochastic knapsack problem: the benefit of adaptivity. In Proceedings of the Forty-Fifth IEEE Symposium on Foundations of Computer Science (FOCS), 2004.
11. J. Fakcheroenphol, S. Rao, and K. Talwar. A tight bound on approximating arbitrary metrics by tree metrics. In Proceedings of the Thirty-Fifth ACM Symposium on Theory of Computing (STOC), pages 448-455, 2003.
12. A. Fiat and G. J. Woeginger, editors. Online Algorithms: The State of the Art. Springer, 1998.
13. M. R. Garey and D. S. Johnson. Computers and Intractability: A guide to the theory of NP-completeness. W. H. Freeman, San Francisco, 1979.
14. A. Goel and D. Estrin. Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk. In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), pages 499-505, 2003.
15. A. Gupta, R. Krauthgamer, and J. R. Lee. Bounded geometries, fractals, and low-distortion embeddings. In Proceedings of the Forty-Fourth IEEE Symposium on Foundations of Computer Science (FOCS), 2003.
16. A. Gupta, M. Pal, R. Ravi, and A. Sinha. Boosted sampling: Approximation algorithms for stochastic optimization. In Proceedings of the Thirty-Sixth ACM Symposium on Theory of Computing (STOC), pages 417-426, 2004.
17. N. Immorlica, D. R. Karger, M. Minkoff, and V. S. Mirrokni. On the costs and benefits of procrastination: Approximation algorithms for stochastic combinatorial optimization problems. In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), pages 691-700, 2004.
18. D. R. Karger and M. Minkoff. Building steiner trees with incomplete global knowledge. In Proceedings of the Forty-First IEEE Symposium on Foundations of Computer Science (FOCS), pages 613-623, 2000.
19. R. R. Mettu and C. G. Plaxton. The online median problem. In Proceedings of the Forty-First IEEE Symposium on Foundations of Computer Science (FOCS), pages 339-348, 2000.
20. A. Meyerson. Online facility location. In Proceedings of the Forty-Second IEEE Symposium on Foundations of Computer Science (FOCS), pages 426-433, 2001.
21. M. Minkoff. Approximation Algorithms for Combinatorial Optimization Under Uncertainty. PhD thesis, M.I.T., Cambridge, MA, 2003.
22. D. Peleg. Distributed Computing: A Locality-Sensitive Approach. SIAM, Philadelphia, PA, 2000.
23. L. K. Platzman and I. J. J. Bartholdi. Spacefilling curves and the planar travelling salesman problem. Journal of the ACM (JACM), 36(4):719-737, October 1989.
24. C. G. Plaxton. Approximation algorithms for hierarchical location problems. In Proceedings of the Thirty-Fifth ACM Symposium on Theory of Computing (STOC), pages 40-49, 2003.
25. H. Racke. Minimizing congestion in general networks. In Proceedings of the Forty-Third IEEE Symposium on Foundations of Computer Science (FOCS), pages 43-52, 2002.
26. D. D. Sleator and R. E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28(2):202-208, 1985.
27. L. G. Valiant and G. Brebner. Universal schemes for parallel communication. In Proceedings of the Thirteenth ACM Symposium on Theory of Computing (STOC), pages 263-277, 1981.