The value of strong inapproximability results for clique

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2000, Pages 144-152

  Srinivasan, Aravind ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

approximation algorithms; clique; inapproximability; independent set; P vs. NP; packing integer programs; random sampling

Indexed keywords

CLIQUE; INAPPROXIMABILITY; INDEPENDENT SET; PACKING INTEGER PROGRAMS; RANDOM SAMPLING;

APPROXIMATION ALGORITHMS; INTEGER PROGRAMMING; POLYNOMIAL APPROXIMATION; ALGORITHMS; APPROXIMATION THEORY; GRAPH THEORY; POLYNOMIALS; RANDOM PROCESSES; SAMPLING; SET THEORY;

COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY;

APPROXIMATION ALGORITHMS; CLIQUE; INDEPENDENT SETS;

EID: 0033690278     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/335305.335322     Document Type: Conference Paper

References (13)

1. A. Blum. Algorithms for approximate graph coloring. Ph.D. Thesis, Dept. of Electrical Engineering and Computer Science, MIT, 1991.
2. R. B. Boppana and M. M. Halldórsson. Approximating maximum independent sets by excluding subgraphs. BIT, 32:180-196, 1992.
3. 1-o(1). Manuscript, 1999.
4. U. Feige. Randomized graph products, chromatic numbers, and the Lovasz υ-function. In Proc. ACM Symposium on Theory of Computing, pages 635-640, 1995.
5. U. Feige, S. Goldwasser, L. Lovász, S. Safra, and M. Szegedy. Interactive proofs and the hardness of approximating cliques. Journal of the ACM, 43:268-292, 1996.
6. M. M. Halldórsson. Approximation via partitioning. Res. Report IS-RR-95-00JF, Japan Advanced Institute of Science and Technology, 1995.
7. M. M. Halldórsson. Approximations of independent sets in graphs. Survey paper, Proc. APPROX '98 Conference, 1998.
8. 1-e. In Proc. IEEE Symposium on Foundations of Computer Science, pages 627-636, 1996. To appear in Aeta Mathematica.
9. P. Raghavan. Probabilistic construction of deterministic algorithms: approximating packing integer programs. Journal of Computer and System Sciences, 37:130-143, 1988.
10. A. Samorodnitsky and L. Trevisan. A PCP characterization of NP with optimal amortized query complexity. In Proc. ACM Symposium on Theory of Computing, 2000.
11. J. P. Schmidt, A. Siegel, and A. Srinivasan. Chernoff-Hoeffding bounds for applications with limited independence. SIAM Journal on Discrete Mathematics, 8:223-250, 1995.
12. A. Srinivasan. Improved approximation guarantees for packing and covering integer programs. SIAM J. Comput., 29:648-670, 1999.
13. A. C.-C. Yao. Probabilistic computations: towards a unified measure of complexity. In Proc. IEEE Symposium on Foundations of Computer Science, pages 222-227, 1977.