scientific article; zbMATH DE number 7561575

DOI10.4230/LIPIcs.ICALP.2019.82MaRDI QIDQ5091241

Ulrike Schmidt-Kraepelin, Jannik Matuschke, José Verschae

Publication date: 21 July 2022

Full work available at URL: https://arxiv.org/abs/1811.10580

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

matchingsrobust optimizationapproximation algorithms

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Related Items (2)

Unnamed Item ⋮ Permutation Strikes Back: The Power of Recourse in Online Metric Matching

Cites Work

• Unnamed Item
• A matching-based approach for solving a delivery/pick-up vehicle routing problem with time constraints
• Weighted matching with vertex weights: An application to scheduling training sessions in NASA space shuttle cockpit simulators
• On-line algorithms for weighted bipartite matching and stable marriages
• Online matching on a line
• Edmonds, matching and the birth of polyhedral combinatorics
• The Online Metric Matching Problem for Doubling Metrics
• Weighted Matching in Chess Tournaments
• The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
• On a Greedy Heuristic for Complete Matching
• Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming
• A Robust and Optimal Online Algorithm for Minimum Metric Bipartite Matching
• Robust recoverable perfect matchings
• Online Weighted Matching
• Online perfect matching and mobile computing
• Online Steiner Tree with Deletions
• The power of deferral
• Maximum matching and a polyhedron with 0,1-vertices
• The Power of Recourse for Online MST and TSP

This page was built for publication: