메뉴 건너뛰기




Volumn 2, Issue 4, 1982, Pages 385-393

An analysis of the greedy algorithm for the submodular set covering problem

Author keywords

AMS subject classification (1980): 68C05, 68C25, 90C10, 05B35

Indexed keywords


EID: 51249182537     PISSN: 02099683     EISSN: 14396912     Source Type: Journal    
DOI: 10.1007/BF02579435     Document Type: Article
Times cited : (488)

References (10)
  • 3
    • 84932501506 scopus 로고    scopus 로고
    • G. Dobson, Worst Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data, Technical Report SOL 80-25, Stanford, October 1980.
  • 4
    • 84932500422 scopus 로고    scopus 로고
    • M. L. Fisher and L. A. Wolsey, On the Greedy Heuristic for Covering and Packing Problems, CORE, DP 8124, Louvain-la-Neuve, May 1981.
  • 8
    • 84932428457 scopus 로고    scopus 로고
    • G. L. Nemhauser and L. A. Wolsey, Maximising Submodular Set Functions: Formulations and Analysis of Algorithms, CORE, DP 7832, Louvain La-Neuve, August 1978, to appear in Ann. of. Disc. Math.


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