Polylogarithmic inapproximability

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2003, Pages 585-594

  Halperin, Eran ^a   Krauthgamer, Robert ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Approximation algorithms; Hardness of approximation; Integrality ratio; Polylogarithmic approximation; Steiner tree

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; GRAPH THEORY; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING;

INTEGRALITY RATIO;

COMPUTATIONAL COMPLEXITY;

EID: 0038784524     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/780542.780628     Document Type: Conference Paper

References (24)

1. S. Arora and C. Lund. Hardness of approximations. In D. Hochbaum, editor, Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, 1996.
2. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and the hardness of approximation problems. J. ACM, 45(3):501-555, 1998.
3. Y. Bartal. On approximating arbitrary metrics by tree metrics. In 30th Annual ACM Symposium on Theory of Computing, pages 161-168. ACM, 1998.
4. Y. Bartal and M. Mendel. Multi-embeddings and path approximation of metric spaces. In 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 424-433, 2003.
5. M. Charikar, C. Chekuri, T. Cheung, Z. Dai, A. Goel, S. Guha, and M. Li. Approximation algorithms for directed Steiner problems. J. Algorithms, 33(1):73-91, 1999.
6. M. Charikar, C. Chekuri, A. Goel, and S. Guha. Rounding via trees: deterministic approximation algorithms for group Steiner trees and k-median. In 30th Annual ACM Symposium on Theory of Computing, pages 114-123. ACM, New York, 1998.
7. C. Chekuri, G. Even, and G. Kortsarz. An approximation algorithm for the group Steiner problem. Manuscript. (Preliminary version appeared in SODA 2002), 2002.
8. G. Even, J. Naor, S. Rao, and B. Schieber. Divide-and-conquer approximation algorithms via spreading metrics. J. ACM, 47(4):585-616, 2000.
9. G. Even, J. Naor, B. Schieber, and M. Sudan. Approximating minimum feedback sets and multicuts in directed graphs. Algorithmica, 20(2): 151-174, 1998.
10. J. Fakcharoenphol, S. Rao, and K. Talwar. A tight bound on approximating arbitrary metrics by tree metrics. To appear in 35th Annual ACM Symposium on Theory of Computing, 2003.
11. U. Feige. A threshold of ln n for approximating set cover. J. ACM, 45(4):634-652, 1998.
12. U. Feige, M. M. Halldórsson, G. Kortsarz, and A. Srinivasan. Approximating the domatic number. SIAM J. Comput., 2002. To appear.
13. N. Garg, G. Konjevod, and R. Ravi. A polylogarithmic approximation algorithm for the group Steiner tree problem. J. Algorithms, 37(1):66-84, 2000.
14. A. Gupta, E. Halperin, G. Kortsarz, R. Krauthgamer, R. Ravi, A. Srinivasan, and N, Wang. Private communication. 2002.
15. E. Halperin, G. Kortsarz, R. Krauthgamer, A. Srinivasan, and N. Wang. Integrality ratio for group Steiner trees and directed Steiner trees. In 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 275-284, Jan. 2003.
16. S. Khanna, M. Sudan, L. Trevisan, and D. P. Williamson. The approximabllity of constraint satisfaction problems. SIAM J. Comput., 30(6):1863-1920, 2001.
17. C. Lund and M. Yannakakis. On the hardness of approximating minimization problems. J. ACM, 41 (5): 960-981, 1994.
18. S. Rao and A. W. Richa. New approximation techniques for some ordering problems. In 9h Annual ACM-SIAM Symposium on Discrete Algorithms, pages 211-218, New York, 1998. ACM.
19. R. Raz. A parallel repetition theorem. SIAM J. Comput., 27(3):763-803, 1998.
20. R. Raz and S. Safra. A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In 29th Annual ACM Symposium on Theory of Computing, pages 475-484, ACM, 1997.
21. S. Safra and O. Schwartz. On the complexity of approximating TSP with neighborhoods and related problems. Manuscript, June 2002.
22. P. D. Seymour. Packing directed circuits fractionally. Combinatorica, 15(2):281-288, 1995.
23. A. Srinivasan. New approaches to covering and packing problems. In 12th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 567-576, 2001.
24. L. Zosin and S. Khuller. On directed Steiner trees. In 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 59-63, 2002.