Online maximum matching with recourse

DOI10.1007/s10878-020-00641-wzbMath1467.90048OpenAlexW2783336934MaRDI QIDQ830934

Christoph Dürr, Shendan Jin, Spyros Angelopoulos

Publication date: 10 May 2021

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/9590/

zbMATH Keywords

matchingcompetitive analysisonline algorithmsrecourse

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (3)

Online load balancing with general reassignment cost ⋮ The power of amortized recourse for online graph problems ⋮ Online knapsack with removal and recourse

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Online constrained optimization with recourse
• Bayesian Mechanism Design
• Improved Bounds for Online Preemptive Matching
• Buyback Problem - Approximate Matroid Intersection with Cancellation Costs
• On Randomized Algorithms for Matching in the Online Preemptive Model
• The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online
• Online Minimization Knapsack Problem
• 64.4 Some logarithm inequalities
• Online Algorithms for Maximum Cardinality Matching with Edge Arrivals
• Online Steiner Tree with Deletions
• Maintaining Assignments Online: Matching, Scheduling, and Flows
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• The Power of Recourse for Online MST and TSP
• Relaxing the irrevocability requirement for online graph algorithms

This page was built for publication: Online maximum matching with recourse