Online budgeted maximum coverage

DOI10.4230/LIPICS.ESA.2016.73MaRDI QIDQ4606347zbMATH OpenOpenAlexFDO

Authors Adi Rosén, Dror Rawitz

Publication date 2 March 2018

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2016/6414/pdf/LIPIcs-ESA-2016-73.pdf/

zbMATH Keywords

online algorithmscompetitive analysismaximum coveragebudgeted coverageremovable online knapsack

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Online budgeted maximum coverage
• The budgeted maximum coverage problem
• A Knapsack Secretary Problem with Applications
• The online set cover problem
• The online set cover problem

Cited in

(3)

• Two-sided capacitated submodular maximization in gig platforms
• Online budgeted maximum coverage
• Online knapsack of unknown capacity. How to optimize energy consumption in smartphones

This page was built for publication: Online budgeted maximum coverage

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