"Submodular set functions, matroids and the greedy algorithm: Tight ..."

Michele Conforti, Gérard Cornuéjols (1984)

> Home

Details and statistics

DOI: 10.1016/0166-218X(84)90003-9

access: open

type: Journal Article

metadata version: 2021-02-11

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dam/ConfortiC84
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/ConfortiC84
Michele Conforti, Gérard Cornuéjols:
Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some generalizations of the Rado-Edmonds theorem. Discret. Appl. Math. 7(3): 251-274 (1984)

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.