Generalized submodular cover problems and applications
Authors:
- 1 January 2001
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 250 (1-2) , 179-200
Abstract
No abstract availableKeywords
Funding Information
- Israel Science Foundation
This publication has 14 references indexed in Scilit:
- On the hardness of approximating minimization problemsJournal of the ACM, 1994
- How to Allocate Network CentersJournal of Algorithms, 1993
- Compression of correlated bit-vectorsInformation Systems, 1991
- A unified approach to approximation algorithms for bottleneck problemsJournal of the ACM, 1986
- An analysis of the greedy algorithm for the submodular set covering problemCombinatorica, 1982
- Heuristics for the fixed cost median problemMathematical Programming, 1982
- Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative DataMathematics of Operations Research, 1982
- A Greedy Heuristic for the Set-Covering ProblemMathematics of Operations Research, 1979
- On the ratio of optimal integral and fractional coversDiscrete Mathematics, 1975
- Approximation algorithms for combinatorial problemsJournal of Computer and System Sciences, 1974