Matroid matching: The power of local search

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2010, Pages 369-378

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

^a IBM RESEARCH   (United States)

^b BM Research   (United States)

Author keywords

local search; matching; matroid; Sherali Adams hierarchy

Indexed keywords

CARDINALITIES; HYPER GRAPH; INTEGRALITY GAPS; LOCAL SEARCH; LP RELAXATION; MATCHING PROBLEMS; MATROIDS; PARITY PROBLEMS;

COMPUTATION THEORY;

GRAPH THEORY;

EID: 77954738591     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1806689.1806741     Document Type: Conference Paper

References (53)

1. E. Arkin and R. Hassin, On local search for weighted k-set packing, Math. of Op. Res. 23(3) (1998) 640-648.
2. M. Balinski, On maximum matching, minimum covering and their connections, in "Proceedings of Princeton Symp. on Math. Prog.," Eds. H. Kuhn, 303-312, Princeton Univ. Press, 1970.
3. V. Bafna, B. Narayanan and R. Ravi, Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles), Discrete Applied Mathematics 71, (1996), no. 1-3, 41-53.
4. A. Barvinok, New algorithms for linear k-matroid intersection and matroid k-parity problems, Math. Program. 69, 449-470 (1995).
5. P. Berman, A d/2 approximation for maximum weight independent set in d-claw free graphs, Nordic J. Comput. 7(3) (2000), 178-184.
6. P. Berman, M. Furer and A. Zelikovsky, Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees, in "Proceedings of CSR 2006," LNCS v.3967, 70-79.
7. G. Calinescu, C. Chekuri, M. Pál and J. Vondrák, Maximizing a submodular set function subject to a matroid constraint, to appear in SIAM Journal on Computing, special issue for STOC 2008.
8. P. Camerini, G. Galbiati and F. Maffioli, Random pseudo-polynomial algorithms for exact matroid problems, Journal of Algorithms, 13:258-273, 1992.
9. Y.H. Chan and L.C. Lau, On linear and semidefinite programming relaxations for hypergraph matching, to appear in SODA 2010.
10. B. Chandra and M. Halldórsson, Greedy local improvement and weighted set packing approximation, J. Algorithms 39(2) (2001), 223-240.
11. S. Chang, D. Llewellyn and J. Vande Vate, Matching 2-lattice polyhedra: finding a maximum vector, Discrete Mathematics 237 (2001), 29-61.
12. S. Chang, D. Llewellyn and J. Vande Vate, Matching 2-lattice polyhedra: duality and extreme points, Discrete Mathematics 237 (2001), no. 1-3, 63-95.
13. V. Chvátal, Edmonds polytopes and a hierarchy of combinatorial problems, Disc. Math. 4 (1973), 305-337.
14. V. Chvátal, W. Cook and M. Hartmann, On cutting-plane proofs in combinatorial optimization, Linear Algebra Appl. 114/115 (1989), 455-499.
15. J. Edmonds, Paths, trees, and flowers, Canadian Journal of Mathematics 17, 449-467, 1965.
16. J. Edmonds, Maximum matching and a polyhedron with 0-1 vertices, Journal of Research National Bureau of Standards, Section B 69, 73-77, 1965.
17. F. Eisenbrand and A.S. Schulz, Bounds on the Chvátal rank of polytopes in the 0/1-cube, Combinatorica 23, 245-261, 2003.
18. M.L. Fisher, G.L. Nemhauser and L.A. Wolsey, An analysis of approximations for maximizing submodular set functions - II. Math. Prog. Study, 8:73-87, 1978.
19. T. Fujito, A 2/3-approximation of the matroid matching problem, in "Proceedings of ISAAC 1993," Lecture Notes in Computer Science v.762, 185-190.
20. H.N. Gabow and M. Stallmann, An augmenting path algorithm for linear matroid parity, Combinatorica 6, 123-150, 1986.
21. D. Gijswijt and G. Pap, An algorithm for weighted fractional matroid matching, TR-2008-11, Technical Report of the Egervary Research Group, Budapest.
22. M. Hartmann, "Cutting Plane Proofs and the Complexity of the Integer Hull," Ph.D. Thesis, Cornell University, Ithaca, 1988.
23. D. Hausmann, B. Korte and T. Jenkyns. Worst case analysis of greedy type algorithms for independence systems, Math. Prog. Study 12 (1980), 120-131.
24. E. Hazan, S. Safra and O. Schwartz. On the complexity of approximating k-set packing. Computational Complexity, 15(1), 20-39, 2006.
25. C. 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. Disc. Math. 2(1) (1989), 68-72.
26. P.M. Jensen and B. Korte, Complexity of matroid property algorithms. SIAM Journal on Computing 11, 184-190, 1982.
27. T.A. Jenkyns, "Matchoids: A generalization of matchings and matroids," Ph.D. thesis, University of Waterloo, Waterloo, Ontario, 1974.
28. T.A. Jenkyns, The efficacy of the "greedy" algorithm, in: "Proc. of 7th SE Conf. on Comb., Graph Theory and Comp," 341-350, 1976.
29. A. Karlin, C. Mathieu and C. Thach Nguyen, Integrality gaps of linear and semi-defifinite programming relaxations for knapsack, manuscript, 2009.
30. M. Laurent, A comparison of the Sherali-Adams, Lovász-Schrijver and Lasserre relaxations for 0-1 programming. Mathematics of Operations Research, 28(3):470-496, 2003.
31. E.L. Lawler, "Combinatorial Optimization: Networks and Matroids," Holt, Rinehart and Winston, 1976.
32. E.L. Lawler, Matroids with parity conditions: a new class of combinatorial optimization problems, Memo. No. ERL-M334, Electronics Research Laboratory, College of Engineering, UC Berkeley, 1971.
33. J. Lee, M. Sviridenko and J. Vondrák, Submodular maximization over multiple matroids via generalized exchange properties, "Proc. of APPROX," Springer LNCS, 244-257, 2009.
34. J. Lee, M. Sviridenko and J. Vondrák, Matroid Matching: the Power of Local Search, IBM Research Report RC24898, 11/2009.
35. L. Lovász, Matroid matching and some applications, J. Comb. Th., Ser. B 28, 208-236, 1980.
36. L. Lovász, The matroid matching problem. In: L. Lovász, L., V.T. Sös (Eds.), "Algebraic Methods in Graph Theory, Vol. II," (Colloq. Szeged, 24-31 August 1978). Colloq., Math. Soc. Janos Bolyai 25, North-Holland, 495-517, 1981.
37. L. Lovász and M.D. Plummer, "Matching Theory," Annals of Disc. Math. 29, North-Holland, 1986.
38. C. Mathieu and A. Sinclair, Sherali-Adams relaxations of the matching polytope, in Proc. STOC 2009.
39. J. Mestre, Greedy in approximation algorithms, in: "Proc. of ESA," 528-539, 2006.
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 Journal of Computing 23(2), 387-397, (1994).
41. J.B. Orlin, A fast, simpler algorithm for the matroid parity problem, In: A. Lodi, A. Panconesi and G. Rinaldi (Eds.), "Proceedings of the The 13th IPCO," (Bertinoro, Italy, 26-28 May 2008), LNCS 5035, 2008, 240-258.
42. J.B. Orlin and J.H. Vande Vate, Solving the linear matroid parity problem as a sequence of matroid intersection problems," Mathematical Programming, 47, 81-106, 1990.
43. A. Recski, "Matroid theory and its applications in electric network theory and in statics," Algorithms and Combinatorics 6, Springer Verlag, Berlin, 1989.
44. A. Recski and J. Szabó, On the generalization of the matroid parity problem. In: A. Bondy, J. Fonlupt, J.-L. Fouquet, J.-C. Fournier, J.L. Ramïrez Alfonsïn (Eds.), "Graph Theory in Paris," Trends in Mathematics, Birkhauser, Basel, 2007, 347-354.
45. A. Schrijver, "Theory of Linear and Integer Programming," Wiley, 1986.
46. A. Schrijver, "Combinatorial Optimization: Polyhedra and Efficiency," Springer-Verlag, Berlin, 2003.
47. 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. on Disc. Math. 3, 411-430, 1990.
48. M. Stallmann and H.N. Gabow, An augmenting path algorithm for the parity problem on linear matroids. In: "Proceedings of the 25th FOCS," (Singer Island, Florida, 24-26 October 1984). IEEE, Washington, DC, 1984, 217-228.
49. 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, Ont., 1982)," 363-374, Academic Press (Toronto, ON), 1984.
50. J. Vande Vate, Fractional matroid matchings, Journal of Combinatorial Theory, Series B 55 (1992), 133-145.
51. V.V. Vazirani, "Approximation Algorithms," Springer-Verlag, Berlin, 2001.
52. D.J.A. Welsh, "Matroid Theory," Academic Press, London-New York, 1976.
53. S.G. Williamson, "Combinatorics for computer science," Comput. Sci. Press, Rockville, MD, 1985.