Approximation algorithms for maximum coverage with group budget constraints

DOI10.1007/978-3-319-71147-8_25zbMath1474.90292OpenAlexW2770235724MaRDI QIDQ1708624

Da-Chuan Xu, Longkun Guo, Min Li

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

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

Related Items (1)

Energy-constrained geometric coverage problem

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