Robust randomized matchings

DOI10.1137/1.9781611973730.127MaRDI QIDQ5363071zbMATH OpenOpenAlexFDO

Authors Jannik Matuschke, José A. Soto, Martin Skutella

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

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

Recommendations

• Robust randomized matchings
• Robust matchings and matroid intersections
• Robust matchings and matroid intersections
• Randomized greedy matching. II
• Randomized strategies for cardinality robustness in the knapsack problem

Cited in

(11)

• On randomized matching mechanisms
• Robust independence systems
• Robust matchings and matroid intersections
• Parametric shortest-path algorithms via tropical geometry
• scientific article; zbMATH DE number 1617264 (Why is no real title available?)
• Robust randomized matchings
• Robust matchings and matroid intersections
• Optimal multivariate matching before randomization
• Packing a knapsack of unknown capacity
• Randomized strategies for cardinality robustness in the knapsack problem
• Randomized strategies for cardinality robustness in the knapsack problem

This page was built for publication: Robust randomized matchings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5363071)