Online Budgeted Maximum Coverage

DOI10.4230/LIPICS.ESA.2016.73zbMATH Open1397.68234OpenAlexW2537728301MaRDI QIDQ4606347FDOQ4606347

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)

Cited In (4)

• Relaxing the irrevocability requirement for online graph algorithms
• Two-sided capacitated submodular maximization in gig platforms
• Online knapsack of unknown capacity. How to optimize energy consumption in smartphones
• Online budgeted maximum coverage

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)