An Analysis of the Greedy Algorithm for the Submodular Set Covering Problem

Wolsey, Laurence

doi:10.1007/BF02579435

An Analysis of the Greedy Algorithm for the Submodular Set Covering Problem

Wolsey, Laurence

(1982) Combinatorica - an international journal of the János Bolyai Mathematical Society — Vol. 2, n° 4, p. 385-393 (1982)

Files

pdfdocument.pdf

Restricted Access
Adobe PDF
363.19 KB

Request a copy

Details

Authors

Wolsey, LaurenceUCLouvain
Author

Affiliations

UCLouvainFSA/INMA - Département d'ingénierie mathématique

Citations

APA
Chicago
FWB

Wolsey, L. (1982). An Analysis of the Greedy Algorithm for the Submodular Set Covering Problem. Combinatorica - an international journal of the János Bolyai Mathematical Society, 2(4), 385-393. https://doi.org/10.1007/BF02579435 (Original work published 1982)