Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some generalizations of the Rado-Edmonds theorem
Work
Year: 1984
Type: article
Source: Discrete Applied Mathematics
Authors Michele Conforti, Gérard Cornuéjols
Institutions New York University, Carnegie Mellon University
Cites: 12
Cited by: 342
Related to: 10
FWCI:
Citation percentile (by year/subfield): 90.96
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed