The generalized maximum coverage problem
From MaRDI portal
Publication:963466
DOI10.1016/J.IPL.2008.03.017zbMath1186.68059OpenAlexW2065487600WikidataQ29011249 ScholiaQ29011249MaRDI QIDQ963466
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
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
This page was built for publication: The generalized maximum coverage problem