The generalized maximum coverage problem

DOI10.1016/J.IPL.2008.03.017MaRDI QIDQ963466zbMATH OpenOpenAlexWikidataFDO

Authors Reuven Cohen, Liran Katzir

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)

Recommendations

• The budgeted maximum coverage problem
• scientific article; zbMATH DE number 1323125
• Tight approximation bounds for maximum multi-coverage
• Approximability of OFDMA Scheduling
• Improved greedy algorithm for maximum coverage problem with group budget constraints

Cites work

• An approximation algorithm for the generalized assignment problem
• An efficient approximation for the generalized assignment problem
• scientific article; zbMATH DE number 1670546 (Why is no real title available?)
• scientific article; zbMATH DE number 1342117 (Why is no real title available?)
• scientific article; zbMATH DE number 1953104 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• The budgeted maximum coverage problem
• Tight approximation algorithms for maximum general assignment problems

Cited in

(20)

• Maximum coverage problem with group budget constraints
• 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
• How to catch a lion in the desert: on the solution of the coverage directed generation (CDG) problem
• 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
• scientific article; zbMATH DE number 2000148 (Why is no real title available?)
• scientific article; zbMATH DE number 6851883 (Why is no real title available?)
• Generalized budgeted submodular set function maximization
• Constant approximation for the lifetime scheduling problem of \(p\)-percent coverage
• Budgeted maximum coverage with overlapping costs: monitoring the emerging infections network
• The Maximal Conditional Covering Problem
• 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
• The ground-set-cost budgeted maximum coverage problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q963466)