Online maximum matching with recourse
type: Item
instance of: scholarly article
title: Online maximum matching with recourse
zbMATH Open document ID: 1467.90048
author: Spyros Angelopoulos
author: Christoph Dürr
author: Shendan Jin
published in: Journal of Combinatorial Optimization
publication date: 2021-05-10T00:00:00Z
full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/9590/
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 7346747
zbMATH Keywords: matching
zbMATH Keywords: online algorithms
zbMATH Keywords: competitive analysis
zbMATH Keywords: recourse
MaRDI profile type: Publication
OpenAlex ID: W2783336934
cites work: Online constrained optimization with recourse
cites work: Q4607943
cites work: Q4223058
cites work: Relaxing the irrevocability requirement for online graph algorithms
cites work: Online Algorithms for Maximum Cardinality Matching with Edge Arrivals
cites work: On Randomized Algorithms for Matching in the Online Preemptive Model
cites work: Improved Bounds for Online Preemptive Matching
cites work: The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online
cites work: Online Steiner Tree with Deletions
cites work: Maintaining Assignments Online: Matching, Scheduling, and Flows
cites work: Online Minimization Knapsack Problem
cites work: Q4737165
cites work: 64.4 Some logarithm inequalities
cites work: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
cites work: The power of recourse for online MST and TSP
cites work: Online matching and ad allocation
cites work: Q4039889
cites work: Buyback Problem - Approximate Matroid Intersection with Cancellation Costs
DOI: 10.1007/S10878-020-00641-W
description: scientific article; zbMATH DE number 7346747