메뉴 건너뛰기
Computational Complexity
Volumn 4, Issue 2, 1994, Pages 133-157
The hardness of approximation: Gap location
Author keywords

approximation algorithms; computational complexity; Hardness of approximation; NP hardness; Subject classifications: 03D15, 68Q25, 68Q15, 68R10
Indexed keywords

EID: 0001326115     PISSN: 10163328     EISSN: 14208954     Source Type: Journal    
DOI: 10.1007/BF01202286     Document Type: Article
Times cited : (156)
References (28)
  • 1
    • 84934433296 scopus 로고    scopus 로고
    • M. Ajtai, Recursive Construction for 3-Regular Expanders. In Proc. 28th Ann. Symp. Found. Comput. Sci., 1987, 295–304.
  • 2
    • 84934433301 scopus 로고    scopus 로고
    • N. Alon, R. A. Duke, H. Lefmann, V. Rödl, and R. Yuster, The Algorithmic Aspects of the Regularity Lemma. In Proc. 33th Ann. Symp. Found. Comput. Sci., 1992, 473–482.
  • 3
    • 84934433302 scopus 로고    scopus 로고
    • S. Arora and S. Safra, Probabilistic Checking of Proofs: A New Characterization of NP. In Proc. 33th Ann. Symp. Found. Comput. Sci., 1992, 1–13.
  • 4
    • 84934433299 scopus 로고    scopus 로고
    • S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, Proof Verification and Intractability of Approximation Problems. In Proc. 33th Ann. Symp. Found. Comput. Sci., 1992, 14–23.
  • 5
    • 84934433300 scopus 로고    scopus 로고
    • M. Bellare and E. Petrank, private communication, 1992.
  • 8
    • 84934433294 scopus 로고    scopus 로고
    • A. Blum, T. Jiang, M. Li, J. Tromp, and M. Yannakakis, Linear Approximation of Shortest Superstrings. In Proc. 31th Ann. Symp. Found. Comput. Sci., 1990, 554–562.
  • 9
    • 84934433292 scopus 로고    scopus 로고
    • E. Dahlhaus, D. S. Johnson, C. H. Papadimitriou, P. D. Seymour, and M. Yannakakis, The Complexity of Multiway Cuts. In Proc. Twenty-forth Ann. ACM Symp. Theor. Comput., 1992, 241–251.
  • 10
    • 84934433293 scopus 로고    scopus 로고
    • U. Feige, S. Goldwasser, L. Lovász, S. Safra, and M. Szegedy, Approximating clique is almost NP-complete. In Proc. 32th Ann. Symp. Found. Comput. Sci., 1991, 2–12.
  • 13
    • 84934433284 scopus 로고    scopus 로고
    • M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979.
  • 15
    • 84934433285 scopus 로고    scopus 로고
    • J. Hastad, S. Phillips, and S. Safra, A well Characterized Approximation Problem. In Proceedings of the 2nd Israel Symposium on Theory of Computing and Systems, 1993, 261–265.
  • 18
    • 84934433286 scopus 로고    scopus 로고
    • R. M. Karp, Reducibility among combinatorial problems. In Complexity of Computer Computations, ed. Raymond E. Miller and James W. Thatcher, Plenum Press, 1972, 85–103.
  • 20
    • 84934433287 scopus 로고    scopus 로고
    • L. Lovász, Coverings and Colorings of Hypergraphs. In Proc. 4-th Southern Conference on Combinatorics, Graph Theory, and Computing, Utilitas Mathematica Publishing, 1973, 3–12.
  • 21
    • 84934433288 scopus 로고    scopus 로고
    • C. Lund and M. Yannakakis, On the Hardness of Approximating Minimization Problems. In Proc. Twenty-fifth Ann. ACM Symp. Theor. Comput., 1993, 286–293.
  • 22
    • 0000789645 scopus 로고
    • Explicit Constructions of Concentrators
    • English translation in Problems Inform. Transmission, 1975, 325–332
    • (1973) Comm. ACM , vol.9 , pp. 71-80
    • Margulis, G.A.1
  • 23
    • 84934433289 scopus 로고    scopus 로고
    • R. Motwani, Lecture Notes on Approximation Algorithms. Technical report, Dept. of Computer Science, Stanford University, 1992.
  • 25
    • 84934433290 scopus 로고    scopus 로고
    • C. H. Papadimitriou and M. Yannakakis, The Traveling Salesman Problem with Distances One and Two. Mathematics of Operations Research (to appear).
  • 26
    • 84934433291 scopus 로고    scopus 로고
    • E. Petrank, The Hardness of Approximation: Gap Location. In Proceedings of the 2nd Israel Symposium on Theory of Computing and Systems, 1993, 275–284.

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.