Robust randomized matchings

DOI10.1137/1.9781611973730.127zbMath1371.05231OpenAlexW2950897191MaRDI QIDQ5363071

Jannik Matuschke, Jose A. Soto

Publication date: 5 October 2017

Published in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611973730.127

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (4)

Packing a Knapsack of Unknown Capacity ⋮ Randomized strategies for cardinality robustness in the knapsack problem ⋮ Robust Randomized Matchings ⋮ Parametric Shortest-Path Algorithms via Tropical Geometry

This page was built for publication: Robust randomized matchings