메뉴 건너뛰기
Information Processing Letters
Volumn 65, Issue 3, 1998, Pages 151-156
Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP
Author keywords

Approximation; Computational complexity; Maximum independent set problem
Indexed keywords

EID: 0041355336     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(97)00219-6     Document Type: Article
Times cited : (13)
References (12)
  • 1
    • 0041634828 scopus 로고    scopus 로고
    • It is hard to know when greedy is good for finding independent sets
    • H.L. Bodlaender, D. Thilikos, K. Yamazaki, It is hard to know when greedy is good for finding independent sets, Inform. Process. Lett. 61 (1997) 101-106.
    • (1997) Inform. Process. Lett. , vol.61 , pp. 101-106
    • Bodlaender, H.L.1    Thilikos, D.2    Yamazaki, K.3
  • 3
    • 0027929413 scopus 로고
    • Greed is good: Approximating independent sets in sparse and bounded-degree graphs
    • ACM Press
    • M.M. Halldorsson, J. Radhakrishnan, Greed is good: Approximating independent sets in sparse and bounded-degree graphs, in: Proc. 26th ACM Symp. on Theory of Computing, ACM Press, 1994, pp. 439-448.
    • (1994) Proc. 26th ACM Symp. on Theory of Computing , pp. 439-448
    • Halldorsson, M.M.1    Radhakrishnan, J.2
  • 5
    • 0024134606 scopus 로고
    • The polynomial time hierarchy collapses if the boolean hierarchy collapses
    • Erratum: SIAM J. Comput. 20 (2) (1988) 404
    • J. Kadin, The polynomial time hierarchy collapses if the boolean hierarchy collapses, SIAM J. Comput. 17 (1988) 1263-1282; Erratum: SIAM J. Comput. 20 (2) (1988) 404.
    • (1988) SIAM J. Comput. , vol.17 , pp. 1263-1282
    • Kadin, J.1
  • 7
    • 84985359842 scopus 로고
    • The equivalence problem for regular expressions with squaring requires exponential space
    • A. Meyer, L. Stockmeyer, The equivalence problem for regular expressions with squaring requires exponential space, In: Proc. 13th IEEE Symp. on Switching and Automata Theory, 1972, pp. 125-129.
    • (1972) Proc. 13th IEEE Symp. on Switching and Automata Theory , pp. 125-129
    • Meyer, A.1    Stockmeyer, L.2
  • 8
    • 0021406238 scopus 로고
    • The complexity of facets (and some facets of complexity)
    • C. Papadimitriou, M. Yannakakis, The complexity of facets (and some facets of complexity), J. Comput. System Sci. 28 (1984) 244-259.
    • (1984) J. Comput. System Sci. , vol.28 , pp. 244-259
    • Papadimitriou, C.1    Yannakakis, M.2
  • 9
    • 44649167785 scopus 로고
    • The polynomial-time hierarchy
    • L. Stockmeyer, The polynomial-time hierarchy, Theoret. Comput. Sci. 3 (1977) 1-22.
    • (1977) Theoret. Comput. Sci. , vol.3 , pp. 1-22
    • Stockmeyer, L.1
  • 10
    • 0030099678 scopus 로고    scopus 로고
    • Well-covered claw-free graphs
    • D. Tankus, M. Tarsi, Well-covered claw-free graphs, J. Combin. Theory 66 (1996) 293-302.
    • (1996) J. Combin. Theory , vol.66 , pp. 293-302
    • Tankus, D.1    Tarsi, M.2
  • 11
    • 0023467207 scopus 로고
    • More complicated questions about maxima and minima, and some closures of NP
    • K. Wagner, More complicated questions about maxima and minima, and some closures of NP, Theoret. Comput. Sci. 51 (1987) 53-80.
    • (1987) Theoret. Comput. Sci. , vol.51 , pp. 53-80
    • Wagner, K.1
  • 12
    • 0025507099 scopus 로고
    • Bounded query classes
    • K. Wagner, Bounded query classes, SIAM J. Comput. 19 (1990) 833-846.
    • (1990) SIAM J. Comput. , vol.19 , pp. 833-846
    • Wagner, K.1

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