Generalized submodular cover problems and applications
type: Item
instance of: scholarly article
title: Generalized submodular cover problems and applications
zbMATH Open document ID: 0952.68063
DOI: 10.1016/S0304-3975(99)00130-9
published in: Theoretical Computer Science
publication date: 2000-12-12T00:00:00Z
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 1542264
zbMATH Keywords: NP-hard problems
zbMATH Keywords: greedy approximation
zbMATH Keywords: submodular covers
author: Judit Bar-Ilan
author: Guy Kortsarz
author: David Peleg
MaRDI profile type: Publication
cites work: How to Allocate Network Centers
cites work: A Greedy Heuristic for the Set-Covering Problem
cites work: Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data
cites work: Q4228484
cites work: Q4198056
cites work: Dioïds and semirings: Links to fuzzy sets and other applications
cites work: Heuristics for the fixed cost median problem
cites work: Approximation algorithms for combinatorial problems
cites work: Q5501786
cites work: Q4250157
cites work: On the ratio of optimal integral and fractional covers
cites work: On the hardness of approximating minimization problems
cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
cites work: Q4527015
cites work: Q4526991
cites work: An analysis of the greedy algorithm for the submodular set covering problem
full work available at URL: s0304-3975(99)00130-9
OpenAlex ID: W2087937221
description: scientific article; zbMATH DE number 1542264