Online constrained optimization with recourse

DOI10.1016/j.ipl.2012.09.011zbMath1259.68241OpenAlexW1968997853MaRDI QIDQ1943619

Claire Mathieu, L. Parkinson, T. Avitabile

Publication date: 20 March 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2012.09.011

zbMATH Keywords

online algorithmsmaximum cutapproximation algorithmsbipartite matchingad-auctions

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Related Items (5)

Online maximum matching with recourse ⋮ The power of amortized recourse for online graph problems ⋮ Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem ⋮ Unnamed Item ⋮ Online Maximum Matching with Recourse

This page was built for publication: Online constrained optimization with recourse