The generalized maximum coverage problem

DOI10.1016/j.ipl.2008.03.017zbMath1186.68059WikidataQ29011249 ScholiaQ29011249MaRDI QIDQ963466

Liran Katzir, Reuven Cohen

Publication date: 19 April 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.03.017

zbMATH Keywords

approximation algorithms; maximum coverage

Mathematics Subject Classification ID

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

68W25: Approximation algorithms

Related Items

Unnamed Item, A hybrid solution method for the bi-objective traffic counting location problem using previous origin-destination trip tables, Monotone \(k\)-submodular knapsack maximization: an analysis of the Greedy+Singleton algorithm, \textsc{Greedy+Singleton}: an efficient approximation algorithm for \(k\)-submodular knapsack maximization, Micro-review synthesis for multi-entity summarization, Generalized budgeted submodular set function maximization, A refined analysis of submodular greedy, Approximations for restrictions of the budgeted and generalized maximum coverage problems, Preference elicitation and robust winner determination for single- and multi-winner social choice, Approximation algorithms for the geometric firefighter and budget fence problems, The multi-budget maximum weighted coverage problem, Practical budgeted submodular maximization

Cites Work

• An efficient approximation for the generalized assignment problem
• An approximation algorithm for the generalized assignment problem
• The budgeted maximum coverage problem
• Tight approximation algorithms for maximum general assignment problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item