Robust Matchings and Matroid Intersections

DOI10.1007/978-3-642-15781-3_11zbMath1287.05114OpenAlexW1608359039MaRDI QIDQ5901161

Kazuhisa Makino, Yusuke Kobayashi, Ryo Fujita

Publication date: 6 September 2010

Published in: Algorithms – ESA 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15781-3_11

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Computing knapsack solutions with cardinality robustness ⋮ Robust Independence Systems

This page was built for publication: Robust Matchings and Matroid Intersections