Approximation algorithms for maximum coverage with group budget constraints

DOI10.1007/978-3-319-71147-8_25MaRDI QIDQ1708624zbMATH OpenOpenAlexFDO

Authors Longkun Guo, M. Li, Dachuan Xu

Publication date 26 March 2018

Full work available at URL https://doi.org/10.1007/978-3-319-71147-8_25

zbMATH Keywords

partitionapproximation algorithmnetwork flowauxiliary graphmaximum coverage problem with group budget constraintsrandomized linear programming rounding

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Approximation algorithms (68W25) Integer programming (90C10)

Recommendations

• Efficient approximation algorithms for maximum coverage with group budget constraints
• Maximum coverage problem with group budget constraints
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Improved greedy algorithm for maximum coverage problem with group budget constraints
• The budgeted maximum coverage problem

Cited in

(9)

• Energy-constrained geometric coverage problem
• A 1/2 approximation algorithm for energy-constrained geometric coverage problem
• scientific article; zbMATH DE number 6851883 (Why is no real title available?)
• The budgeted maximum coverage problem
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Maximum coverage problem with group budget constraints
• Improved greedy algorithm for maximum coverage problem with group budget constraints
• Efficient approximation algorithms for maximum coverage with group budget constraints
• The multi-budget maximum weighted coverage problem

This page was built for publication: Approximation algorithms for maximum coverage with group budget constraints

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