Approximations for restrictions of the budgeted and generalized maximum coverage problems

DOI10.1016/j.entcs.2019.08.058OpenAlexW2978317471WikidataQ113317371 ScholiaQ113317371MaRDI QIDQ2132403

Breno Piva

Publication date: 27 April 2022

Full work available at URL: https://doi.org/10.1016/j.entcs.2019.08.058

zbMATH Keywords

approximation algorithmpseudo-polynomial algorithmbudgeted maximum coveragegeneralized maximum coverageknapsack with conflict graph

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Graph theory (05Cxx)

Cites Work

• The generalized maximum coverage problem
• The budgeted maximum coverage problem
• Approximation of knapsack problems with conflict and forcing graphs
• Efficient recovery from power outage (extended abstract)

This page was built for publication: Approximations for restrictions of the budgeted and generalized maximum coverage problems