Matroid Matching: The Power of Local Search
From MaRDI portal
Publication:2839182
DOI10.1137/11083232XzbMath1310.68243MaRDI QIDQ2839182
Jan Vondrák, M. I. Sviridenko, Jon Lee
Publication date: 4 July 2013
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Hypergraphs (05C65) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35) Approximation algorithms (68W25)
Related Items (13)
Approximating Bounded Degree Deletion via Matroid Matching ⋮ Stochastic packing integer programs with few queries ⋮ FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective ⋮ Decentralized algorithms for distributed integer programming problems with a coupling cardinality constraint ⋮ A Weighted Linear Matroid Parity Algorithm ⋮ Weighted matching with pair restrictions ⋮ Unnamed Item ⋮ Representative families for matroid intersections, with applications to location, packing, and covering problems ⋮ Optimal matroid partitioning problems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On matroid parity and matching polytopes ⋮ Locally defined independence systems on graphs
This page was built for publication: Matroid Matching: The Power of Local Search
