Matroid matching
From MaRDI portal
Publication:2875164
DOI10.1145/1806689.1806741zbMath1293.05035MaRDI QIDQ2875164
Jan Vondrák, Jon Lee, M. I. Sviridenko
Publication date: 13 August 2014
Published in: Proceedings of the forty-second ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1806689.1806741
05C65: Hypergraphs
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05B35: Combinatorial aspects of matroids and geometric lattices
68W25: Approximation algorithms
Related Items
Lower bounds for the Chvàtal-Gomory rank in the 0/1 cube, Inequalities on submodular functions via term rewriting, A simple PTAS for weighted matroid matching on strongly base orderable matroids, A simple PTAS for Weighted Matroid Matching on Strongly Base Orderable Matroids, Submodular Stochastic Probing on Matroids