The generalized maximum coverage problem

DOI10.1016/J.IPL.2008.03.017zbMath1186.68059OpenAlexW2065487600WikidataQ29011249 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 algorithmsmaximum coverage

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Related Items (12)

Approximations for restrictions of the budgeted and generalized maximum coverage problems ⋮ 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 ⋮ Unnamed Item ⋮ The multi-budget maximum weighted coverage problem ⋮ Practical budgeted submodular maximization ⋮ Micro-review synthesis for multi-entity summarization ⋮ Preference elicitation and robust winner determination for single- and multi-winner social choice ⋮ Generalized budgeted submodular set function maximization ⋮ A refined analysis of submodular greedy ⋮ Approximation algorithms for the geometric firefighter and budget fence problems

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

This page was built for publication: The generalized maximum coverage problem