Maximum coverage problem with group budget constraints

DOI10.1007/s10878-016-0102-0zbMath1382.90087OpenAlexW2560616732MaRDI QIDQ1680483

Boaz Farbstein, Asaf Levin

Publication date: 16 November 2017

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-016-0102-0

zbMATH Keywords

greedy algorithmapproximation algorithmsmaximum coverage

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (4)

Energy-constrained geometric coverage problem ⋮ The multi-budget maximum weighted coverage problem ⋮ Efficient approximation algorithms for maximum coverage with group budget constraints ⋮ Maximum coverage with cluster constraints: an LP-based approximation technique

Cites Work

• Unnamed Item
• Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
• The budgeted maximum coverage problem
• Pipage rounding: a new method of constructing algorithms with proven performance guarantee
• On the complexity of approximating \(k\)-set packing
• A threshold of ln n for approximating set cover
• Improved algorithms for orienteering and related problems
• The Maximum Coverage Location Problem
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

This page was built for publication: Maximum coverage problem with group budget constraints