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

Publisher Website

1 December 1982

journal article
Published by Springer Nature in Combinatorica

Vol. 2 (4) , 385-393
https://doi.org/10.1007/bf02579435

Abstract

No abstract available

Keywords

All Related Versions

Version 1, RePEc (Unconfirmed version)

This publication has 7 references indexed in Scilit:

Approximation algorithms for combinatorial problems
Published by Elsevier ,2007
Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems
Mathematics of Operations Research, 1982
A Canonical Representation of Simple Plant Location Problems and Its Applications
SIAM Journal on Algebraic Discrete Methods, 1980
A Greedy Heuristic for the Set-Covering Problem
Mathematics of Operations Research, 1979
An analysis of approximations for maximizing submodular set functions—I
Mathematical Programming, 1978
On the ratio of optimal integral and fractional covers
Discrete Mathematics, 1975
Note on Independence Functions
Proceedings of the London Mathematical Society, 1957