메뉴 건너뛰기




Volumn 69, Issue 4, 2004, Pages 547-561

Approximating the dense set-cover problem

Author keywords

Approximation algorithm; Set cover; Vertex cover

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CONSTRAINT THEORY; PROBLEM SOLVING; SET THEORY;

EID: 6344228239     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jcss.2004.03.006     Document Type: Article
Times cited : (10)

References (10)
  • 1
    • 0013188975 scopus 로고
    • A linear time approximation algorithm for the weighted vertex cover problem
    • Bar-Yehuda R., Even S. A linear time approximation algorithm for the weighted vertex cover problem. J. Algorithms. 2:1981;198-203.
    • (1981) J. Algorithms , vol.2 , pp. 198-203
    • Bar-Yehuda, R.1    Even, S.2
  • 2
    • 0002392504 scopus 로고
    • A local-ratio theorem for approximating the weighted vertex cover problem
    • Bar-Yehuda R., Even S. A local-ratio theorem for approximating the weighted vertex cover problem. Ann. Discrete Math. 25:1985;27-46.
    • (1985) Ann. Discrete Math. , vol.25 , pp. 27-46
    • Bar-Yehuda, R.1    Even, S.2
  • 3
    • 6344267329 scopus 로고    scopus 로고
    • On some approximation algorithms for dense vertex cover problem
    • Springer
    • A. Eremeev, On some approximation algorithms for dense vertex cover problem, Proceedings of SOR'99, Springer, 2000, pp. 58-62.
    • (2000) Proceedings of SOR'99 , pp. 58-62
    • Eremeev, A.1
  • 5
    • 0000253416 scopus 로고
    • Approximation algorithms for the set covering and vertex cover problems
    • Hochbaum D.S. Approximation algorithms for the set covering and vertex cover problems. SIAM J. Comput. 11(3):1982;555-556.
    • (1982) SIAM J. Comput. , vol.11 , Issue.3 , pp. 555-556
    • Hochbaum, D.S.1
  • 6
    • 0016349356 scopus 로고
    • Approximation algorithms for combinatorial problems
    • Johnson D.S. Approximation algorithms for combinatorial problems. J. Comput. System Sci. 9:1974;256-278.
    • (1974) J. Comput. System Sci. , vol.9 , pp. 256-278
    • Johnson, D.S.1
  • 8
    • 0022045936 scopus 로고
    • Ramsey numbers and an approximation algorithm for the vertex cover problem
    • Monien B., Speckenmeyer E. Ramsey numbers and an approximation algorithm for the vertex cover problem. Acta Inform. 22:1985;115-123.
    • (1985) Acta Inform. , vol.22 , pp. 115-123
    • Monien, B.1    Speckenmeyer, E.2
  • 9
    • 0347786278 scopus 로고    scopus 로고
    • An approximation of the minimum vertex cover in a graph
    • Nagamochi H., Ibaraki T. An approximation of the minimum vertex cover in a graph. Japan J. Indust. Appl. Math. 16:1999;369-375.
    • (1999) Japan J. Indust. Appl. Math. , vol.16 , pp. 369-375
    • Nagamochi, H.1    Ibaraki, T.2
  • 10
    • 34250404286 scopus 로고
    • Vertex packings: Structural properties and algorithms
    • Nemhauser G.L., Trotter L.E. Vertex packings. structural properties and algorithms Math. Programming. 8:1975;232-248.
    • (1975) Math. Programming , vol.8 , pp. 232-248
    • Nemhauser, G.L.1    Trotter, L.E.2


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