Improved greedy algorithm for maximum coverage problem with group budget constraints

MaRDI QIDQ5454000zbMATH OpenFDO

Authors Sheng Zhang, Xing-Quan Wang, Shanglu He

Publication date 3 April 2008

zbMATH Keywords

greedy algorithm

Mathematics Subject Classification ID

Production models (90B30) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Maximum coverage problem with group budget constraints
• Approximation algorithms for maximum coverage with group budget constraints
• The budgeted maximum coverage problem
• Generalized budgeted submodular set function maximization
• Efficient approximation algorithms for maximum coverage with group budget constraints

Cited in

(8)

• The budgeted maximum coverage problem
• Maximum coverage problem with group budget constraints
• Approximation algorithms for maximum coverage with group budget constraints
• Approximations for restrictions of the budgeted and generalized maximum coverage problems
• Efficient approximation algorithms for maximum coverage with group budget constraints
• Tight approximation bounds for greedy frugal coverage algorithms
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• The generalized maximum coverage problem

This page was built for publication: Improved greedy algorithm for maximum coverage problem with group budget constraints

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