Matroid matching: The power of local search

SIAM Journal on Computing

Volumn 42, Issue 1, 2013, Pages 357-379

  Lee, Jon ^a   Sviridenko, Maxim ^b   Vondrák, Jan ^c  

^a UNIVERSITY OF MICHIGAN   (United States)

^b UNIVERSITY OF WARWICK   (United Kingdom)

^c IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

Chv tal closure; Local search; Matching; Matroid; Sherali Adams hierarchy

Indexed keywords

HYPER GRAPH; INTEGRALITY GAPS; LOCAL SEARCH; MATCHING; MATCHING PROBLEMS; POLYNOMIAL TIME APPROXIMATION SCHEMES; SHERALI-ADAMS HIERARCHIES;

COMPUTATION THEORY; COMPUTER SCIENCE; MATRIX ALGEBRA;

COMBINATORIAL MATHEMATICS;

EID: 84876278180     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/11083232X     Document Type: Article

References (57)

1. E. Arkin and R. Hassin, On local search for weighted k-set packing, Math. Oper. Res., 23 (1998), pp. 640-648. (Pubitemid 128508460)
2. V. Bafna, B. Narayanan, and R. Ravi, Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles), Discrete Appl. Math., 71 (1996), pp. 41-53. (Pubitemid 126391771)
3. M. Balinski, On maximum matching, minimum covering and their connections, in Proceedings of Princeton Symposium on Mathematical Programming, H. Kuhn, ed., Princeton University Press, Princeton, NJ, 1970, pp. 303-312.
4. A. Barvinok, New algorithms for linear k-matroid intersection and matroid k-parity problems, Math. Programming, 69 (1995), pp. 449-470.
5. P. Berman, A d/2 approximation for maximum weight independent set in d-claw free graphs, Nordic J. Comput., 7 (2000), pp. 178-184.
6. P. Berman, M. Fürer, and A. Zelikovsky, Applications of the linear matroid parity algorithm to approximating Steiner trees, in Computer Science - Theory and Applications, Lecture Notes in Comput. Sci. 3967, Springer, Berlin, 2006, pp. 70-79. (Pubitemid 44044893)
7. G. Calinescu, C. Chekuri, M. Pál, and J. Vondrak, Maximizing a monotone submodular function subject to a matroid constraint, SIAM J. Comput., 40 (2011), pp. 1740-1766.
8. P. Camerini, G. Galbiati, and F. Maffioli, Random pseudo-polynomial algorithms for exact matroid problems, J. Algorithms, 13 (1992), pp. 258-273.
9. Y.H. Chan and L.C. Lau, On linear and semidefinite programming relaxations for hypergraph matching, Math. Program. Ser. A, 135 (2012), pp. 123-148.
10. B. Chandra and M. Halld'orsson, Greedy local improvement and weighted set packing approximation, J. Algorithms, 39 (2001), pp. 223-240. (Pubitemid 33668350)
11. S. Chang, D. Llewellyn, and J. Vande Vate, Matching 2-lattice polyhedra: Finding a maximum vector, Discrete Math., 237 (2001), pp. 29-61. (Pubitemid 33660442)
12. S. Chang, D. Llewellyn, and J. Vande Vate, Two-lattice polyhedra: Duality and extreme points, Discrete Math., 237 (2001), pp. 63-95. (Pubitemid 33660443)
13. H.Y. Cheung, L.C. Lau, and K.M. Leung, Algebraic algorithms for linear matroid parity problems, in Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011, pp. 1366-1382.
14. V. Chvatal, Edmonds polytopes and a hierarchy of combinatorial problems, Discrete Math., 4 (1973), pp. 305-337.
15. V. Chvatal, W. Cook, and M. Hartmann, On cutting-plane proofs in combinatorial optimization, Linear Algebra Appl., 114/115 (1989), pp. 455-499.
16. J. Edmonds, Paths, trees, and flowers, Canad. J. Math., 17 (1965), pp. 449-467.
17. J. Edmonds, Maximum matching and a polyhedron with 0, 1-vertices, J. Res. Nat. Bur. Standards Sect. B, 69 (1965), pp. 125-130.
18. F. Eisenbrand and A.S. Schulz, Bounds on the Chvatal rank of polytopes in the 0/1-cube, Combinatorica, 23 (2003), pp. 245-261. (Pubitemid 37206818)
19. M.L. Fisher, G.L. Nemhauser, and L.A. Wolsey, An analysis of approximations for maximizing submodular set functions. II, Math. Programming Stud., 8 (1978), pp. 73-87.
20. T. Fujito, A 2/3-approximation of the matroid matching problem, in Algorithms and Computation (Hong Kong, 1993), Lecture Notes in Comput. Sci. 762, Springer, Berlin, 1993, pp. 185-190.
21. H.N. Gabow and M. Stallmann, An augmenting path algorithm for linear matroid parity, Combinatorica, 6 (1986), pp. 123-150.
22. D. Gijswijt and G. Pap, An Algorithm for Weighted Fractional Matroid Matching, Technical report TR-2008-11, Egervary Research Group, Budapest, Hungary.
23. M. Hartmann, Cutting Plane Proofs and the Complexity of the Integer Hull, Ph.D. thesis, Cornell University, Ithaca, NY, 1988.
24. D. Hausmann, B. Korte, and T. Jenkyns, Worst case analysis of greedy type algorithms for independence systems, Math. Programming Stud., 12 (1980), pp. 120-131.
25. E. Hazan, S. Safra, and O. Schwartz, On the complexity of approximating k-set packing, Comput. Complexity, 15 (2006), pp. 20-39. (Pubitemid 43706824)
26. C.A.J. Hurkens and A. Schrijver, On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems, SIAM J. Discrete Math., 2 (1989), pp. 68-72.
27. P.M. Jensen and B. Korte, Complexity of matroid property algorithms, SIAM J. Comput., 11 (1982), pp. 184-190.
28. T.A. Jenkyns, Matchoids: A Generalization of Matchings and Matroids, Ph.D. thesis, University of Waterloo, Waterloo, ON, Canada, 1974.
29. T.A. Jenkyns, The efficacy of the greedy algorithm, in Proceedings of the 7th Southeastern Conference on Combinatronics, Graph Theory and Computing, 1976, pp. 341-350.
30. A.R. Karlin, C. Mathieu, and C.T. Nguyen, Integrality gaps of linear and semi-definite programming relaxations for Knapsack, in Integer Programming and Combinatorial Optimization, Lecture Notes in Comput. Sci. 6655, Springer, Heidelberg, 2011, pp. 301-314.
31. M. Laurent, A comparison of the Sherali-Adams, Lovász-Schrijver and Lasserre relaxations for 0-1 programming, Math. Oper. Res., 28 (2003), pp. 470-496.
32. E.L. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart, and Winston, New York, 1976.
33. E.L. Lawler, Matroids with Parity Conditions: A New Class of Combinatorial Optimization Problems, Memo ERL-M334, Electronics Research Laboratory, College of Engineering, UC Berkeley, Berkeley, CA, 1971.
34. J. Lee, M. Sviridenko, and J. Vondrak, Submodular maximization over multiple matroids via generalized exchange properties, Math. Oper. Res., 35 (2010), pp. 795-806.
35. L. Lovász, Matroid matching and some applications, J. Combin. Theory Ser. B, 28 (1980), pp. 208-236.
36. L. Lovász, The matroid matching problem, in Algebraic Methods in Graph Theory, Vol. II (Szeged, 1978), L. Lovász and V.T. Sos, eds., Colloq. Math. Soc. J'anos Bolyai 25, North- Holland, Amsterdam, 1981, pp. 495-517.
37. L. Lovász and M.D. Plummer, Matching Theory, Ann. Discrete Math. 29, North-Holland, Amsterdam, 1986.
38. C. Mathieu and A. Sinclair, Sherali-Adams relaxations of the matching polytope, in STOC '09: Proceedings of the 2009 ACM International Symposium on Theory of Computing, ACM, New York, 2009, pp. 293-302.
39. J. Mestre, Greedy in approximation algorithms, in Algorithms: ESA 2006, Lecture Notes in Comput. Sci. 4168, Springer-Verlag, Berlin, 2006, pp. 528-539. (Pubitemid 44699677)
40. H. Narayanan, H. Saran, and V. Vazirani, Randomized parallel algorithms for matroid union and intersection, with applications to arboresences and edge-disjoint spanning trees, SIAM J. Comput., 23 (1994), pp. 387-397.
41. J.B. Orlin, A fast, simpler algorithm for the matroid parity problem, in Integer Programming and Combinatorial Optimization, Lecture Notes in Comput. Sci. 5035, A. Lodi, A. Panconesi, and G. Rinaldi, eds., Springer-Verlag, Berlin, 2008, pp. 240-258.
42. J.B. Orlin and J.H. Vande Vate, Solving the linear matroid parity problem as a sequence of matroid intersection problems, Math. Program., 47 (1990), pp. 81-106.
43. M.J. Piff and D.J.A. Welsh, On the vector representation of matroids, J. London Math. Soc., 2 (1970), pp. 284-288.
44. H.J. Prömel and A. Steger, A new approximation algorithm for the Steiner tree problem with performance ratio 5/3, J. Algorithms, 36 (2000), pp. 89-101.
45. A. Recski, Matroid Theory and Its Applications in Electric Network Theory and in Statics, Algorithms Combin. 6, Springer-Verlag, Berlin, 1989.
46. A. Recski and J. Szab'o, On the generalization of the matroid parity problem, in Graph Theory in Paris, A. Bondy, J. Fonlupt, J.-L. Fouquet, J.-C. Fournier, and J.L. Ramirez Alfonsin, eds., Trends Math., Birkhäuser, Basel, 2007, pp. 347-354.
47. A. Schrijver, Theory of Linear and Integer Programming, Wiley, New York, 1986.
48. A. Schrijver, Combinatorial Optimization: Polyhedra and Efficiency, Springer-Verlag, Berlin, 2003.
49. H.D. Sherali and W.P. Adams, A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems, SIAM J. Discrete Math., 3 (1990), pp. 411-430.
50. M. Singh and K. Talwar, Improving integrality gaps via Chvatal-Gomory rounding, in Approximation, Randomization, and Combinatorial Optimization, M. Serna, R. Shaltiel, K. Jansen, and J. Rolim, eds., Springer-Verlag, Berlin, 2010, pp. 366-379.
51. J. Soto, A simple PTAS for weighted matroid matching on strongly base orderable matroids, Electron. Notes Discrete Math., 37 (2011), pp. 75-80.
52. M. Stallmann and H.N. Gabow, An augmenting path algorithm for linear matroid parity, Combinatorica, 6 (1986), pp. 123-150.
53. P. Tong, E. Lawler, and V. Vazirani, Solving the weighted parity problem for gammoids by reduction to graphic matching, in Progress in Combinatorial Optimization (Waterloo, ON, 1982), Academic Press, Toronto, 1984, pp. 363-374.
54. J. Vande Vate, Fractional matroid matchings, J. Combin. Theory Ser. B, 55 (1992), pp. 133- 145.
55. V.V. Vazirani, Approximation Algorithms, Springer-Verlag, Berlin, 2001.
56. D.J.A. Welsh, Matroid Theory, Academic Press, London, New York, 1976.
57. S.G. Williamson, Combinatorics for Computer Science, Computer Science Press, Rockville, MD, 1985.