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

Laurence A. Wolsey (1982)

> Home

Details and statistics

DOI: 10.1007/BF02579435

access: closed

type: Journal Article

metadata version: 2020-07-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/combinatorica/Wolsey82
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/combinatorica/Wolsey82
Laurence A. Wolsey:
An analysis of the greedy algorithm for the submodular set covering problem. Comb. 2(4): 385-393 (1982)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.