The Library
Matroid matching : the power of local search
Tools
Lee, Jon, Sviridenko, Maxim and Vondrák, Jan (2013) Matroid matching : the power of local search. SIAM Journal on Computing, Volume 42 (Number 1). pp. 357-379. doi:10.1137/11083232X ISSN 0097-5397.
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
Official URL: http://dx.doi.org/10.1137/11083232X
Abstract
We consider the classical matroid matching problem. Unweighted matroid matching for linearly represented matroids was solved by Lovász, and the problem is known to be intractable for general matroids. We present a polynomial-time approximation scheme for unweighted matroid matching for general matroids. In contrast, we show that natural linear-programming relaxations that have been studied have an $\Omega(n)$ integrality gap, and, moreover, $\Omega(n)$ rounds of the Sherali--Adams hierarchy are necessary to bring the gap down to a constant. More generally, for any fixed $k \geq 2$ and $\epsilon>0$, we obtain a $(k/2+\epsilon)$-approximation for matroid matching in $k$-uniform hypergraphs, also known as the matroid $k$-parity problem. As a consequence, we obtain a $(k/2+\epsilon)$-approximation for the problem of finding the maximum-cardinality set in the intersection of $k$ matroids. We also give a $3/2$-approximation for the weighted version of a special case of matroid matching, the matchoid problem.
Item Type: | Journal Article | ||||
---|---|---|---|---|---|
Divisions: | Faculty of Science, Engineering and Medicine > Science > Computer Science | ||||
Journal or Publication Title: | SIAM Journal on Computing | ||||
Publisher: | Society for Industrial and Applied Mathematics | ||||
ISSN: | 0097-5397 | ||||
Official Date: | 2013 | ||||
Dates: |
|
||||
Volume: | Volume 42 | ||||
Number: | Number 1 | ||||
Page Range: | pp. 357-379 | ||||
DOI: | 10.1137/11083232X | ||||
Status: | Peer Reviewed | ||||
Publication Status: | Published | ||||
Access rights to Published version: | Restricted or Subscription Access |
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |