On linear and semidefinite programming relaxations for hypergraph matching

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2010, Pages 1500-1511

  Chan, Yuk Hei ^a   Lau, Lap Chi ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMBINATORIAL OPTIMIZATION; ITERATIVE METHODS; LINEAR PROGRAMMING; LOCAL SEARCH (OPTIMIZATION);

EXTREMAL COMBINATORICS; FRACTIONAL LOCAL RATIO; LINEAR AND SEMIDEFINITE PROGRAMMING; LINEAR PROGRAMMING RELAXATION; LOCAL OPTIMAL SOLUTION; LOCAL SEARCH ALGORITHM; LOCAL SEARCH METHOD; SEMI-DEFINITE PROGRAMMING RELAXATIONS;

GRAPH THEORY;

EID: 77951675232     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973075.122     Document Type: Conference Paper

References (52)

1. [Aha01] R. Aharoni: Ryser's Conjecture for Tripartite 3-graphs. Combinatorica 21(1), 1-4, 2001.
2. [AH00] R. Aharoni, P. Haxell: Hall's Theorem for Hypergraphs. Journal of Graph Theory 35, 83-88, 2000.
3. [AK98] N. Alon, N. Kahale: Approximating the Independence Number via the υ-function. Mathematical Programming 80(3), 253-264, 1998.
4. [AK98] E.M. Arkin, R. Hassin: On Local Search for Weighted k-Set Packing. Mathematics of Operations Research 23(3), 640-648, 1998.
5. [ABL02] S. Arora, B. Bollobás, L. Lovász: Proving Integrality Gaps without Knowing the Linear Program. Proceedings of the 43rd Annual Symposium on Foundations of Computer Science (FOCS), 313-322, 2002.
6. [AFS08] A. Asadpour, U. Feige, A. Saberi: Santa Claus Meets Hypergraph Matchings. Proceedings of APPROX 2008, 10-20, 2008.
7. [BBFR04] R. Bar-Yehuda, K. Bendel, A. Freund, D. Rawitz: Local Ratio: A Unified Framework for Approximation Algorithms. In Memoriam: Shimon Even 1935-2004. ACM Computing Surveys 36(4), 422-463. 2004.
8. [BHN+06] R. Bar-Yehuda, M.M. Halldórsson, J.(S.) Naor, H. Shachnai, I. Shapira: Scheduling Split Intervals. SIAM Journal on Computing 36(1), 1-15, 2006.
9. [BS06] N. Bansal, M. Sviridenko: The Santa Claus Problem. Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC), 31-40, 2006.
10. [Ber00] P. Berman: A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs. Proceedings of the 7th Scandinavian Workshop on Algorithms Theory (SWAT). Lecture Notes in Computer Science, Springer, Volume 1851, 31-40, 2000.
11. [BF94] P. Berman, M. Fürer: Approximating Maximum Independent Set in Bounded Degree Graphs. Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 365-371, 1994.
12. [BK03a] P. Berman, M. Karpinski: Improved Approximation Lower Bound on Small Occurrence Optimization. Electronic Colloquium on Computational Complexity, Report No. 8, 2003.
13. [BK03b] P. Berman, P. Krysta: Optimizing Misdirection. Proceedings of the 14th Annual Symposium on Discrete Algorithms (SODA), 192-201, 2003.
14. [BO04] D. Bienstock, N. Ozbay: Tree-width and the Sherali-Adams Operator. Discrete Optimization 1, 13-21, 2004.
15. [Ca164] M. Calczyńska-Karlowicz: Theorem on Families of Finite Sets. Bulletin de l'Académie Polonaise des Sciences. Série des Sciences Mathématiques, Astronomiques et Physiques 12, 87-89, 1964.
16. [CH99] B. Chandra, M.M. Halldórsson: Greedy Local Improvement and Weighted Set Packing Approximation. Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 169-176, 1999.
17. [CMM07] M. Charikar, K. Makarychev, Y. Makarychev: Local Global Tradeoffs in Metric Embeddings. Proceedings of the 48th Annual Symposium on Foundations of Computer Science (FOCS), 713-723, 2007.
18. [CMM09] M. Charikar, K. Makarychev, Y. Makarychev: Integrality Gaps for Sherali-Adams Relaxations. Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC), 283-292, 2009.
19. [CMWY08] F. Chataigner, G. Manic, Y. Wakabayashi, R. Yuster: Approximation Algorithms and Hardness Results for the Clique Packing Problem, Discrete Applied Mathematics 157(7), 1396-1406, 2008.
20. [Coja05] A. Coja-Oghlan: The Lovász Number of Random Graphs. Combinatorics, Probability and Computing 14(4), 439-465, 2005.
21. [EL73] P. Erdös, L. Lovász: Problems and Results on 3-chromatic Hypergraphs and Some Related Questions. In: Infinite and Finite Sets (A. Hajnal, R Rado, V.T. Sós, Eds.), Proceedings of Colloquia Mathematica Societatis János Bolyai 10, 609-627. Hungary: Keszthely 1973.
22. [Fei95] U. Feige: Randomized Graph Products, Chromatic Numbers, and the Lovász υ-Function. Proceedings of the 27th Annual ACM Symposium on Theory of Computing (STOC), 635-640, 1995.
23. [FK03] U. Feige, R. Krauthgamer: The Probable Value of the Lovász-Schrijver Relaxations for Maximum Independent Set. SIAM Journal on Computing 32(2), 345-370, 2003.
24. [Fur81] Z. Füredi: Maximum Degree and Fractional Matchings in Uniform Hypergraphs. Combinatorica 1(2), 155-162, 1981.
25. [FKS93] Z. Füredi, J. Kahn, P. Seymour: On the Fractional Matching Polytope of a Hypergraph. Combinatorica 13(2), 167-180, 1993.
26. [GRS03] C.P. Gomes, R.G. Regis, D.B. Shmoys: An Improved Approximation Algorithm, for the Partial Latin Square Problem. Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 832-833, 2003.
27. [GLS81] M. Grötschel, L. Lovász, A. Schrijver: The Ellipsoid Method and its Consequences in Combinatorial Optimization. Combinatorics 1, 169-197, 1981.
28. [GLS84] M. Grötschel, L. Lovász, A. Schrijver: Polynomial Algorithms for Perfect Graphs. Annals of Discrete Mathematics 21, 325-356, 1984.
29. [GLS88] M. Grötschel, L. Lovász, A. Schrijver: Geometric Algorithms and Combinatorial Optimization. Springer, New York, 1988.
30. [Hal95] M.H. Halldórsson: Approximating Discrete Collections via Local Improvments. Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 160-169, 1995.
31. [HR97] M.M. Halldórsson, J. Radhakrishnan: Greed is Good: Approximating Independent Sets in Sparse and Bounded-degree Graphs. Algorithmica 18(1), 145-163, 1997.
32. [HJKS07] I. Hajirasouliha, H. Jowhari, R. Kumar and R. Sundaram: On Completing Latin Squares. Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS). Lecture Notes in Computer Science, Springer, Volume 4393, 524-535, 2007.
33. [HR06] R. Hassin, S. Rubinstein: An Approximation Algorithm for Maximum Triangle Packing. Discrete Applied Mathematics 154(6), 971-979, 2006.
34. 1-ε. Acta Math 182(1), 105-142, 1999.
35. [HSS03] E. Hazan, M. Safra, O. Schwartz: On the Complexity of Approximating k-Dimensional Matching. Proceedings of APPROX 2003, Lecture Notes in Computer Science, Springer, Volume 2764, 59-70, 2003.
36. [HSS06] E. Hazan, M. Safra, O. Schwartz: On the Complexity of Approximating k-Set Packing. Computational Complexity 15(1), 20-39, 2006.
37. [HS89] C.A.J. Hurkens, 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 Journal on Discrete Mathematics 2, 68-72, 1989.
38. [Jain01] K. Jain: A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem. Combinatorica 21(1), 39-60, 2001. (Pubitemid 33228662)
39. [Kann91] V. Kann: Maximum Bounded 3-Dimensional Matching is MAX SNP-complete. Information Processing Letters 37(1), 27-35, 1991.
40. [Knu94] D.E. Knuth: The Sandwich Theorem. The Electronic Journal of Combinatorics 1, 1-49, 1994.
41. [Lau03] 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.
42. [Lov79] L. Lovász: On the Shannon Capacity of a Graph. IEEE Transactions on Information Theory 25(1), 1-7, 1979.
43. [LS91] L. Lovász, A. Schrijver: Cones of Matrices and Set-Functions and 0-1 Optimization. SIAM Journal on Optimization 1(2), 166-190, 1991.
44. [MM09] A. Magen, M. Moharrami: Robust Algorithms for Maximum Independent Set on Minor-free Graphs based on the Sherali-Adams Hierarchy. Proceedings of APPROX 2009, 258-271, 2009.
45. [MS09] C. Mathieu and A. Sinclair: Sherali-Adams Relaxations of the Matching Polytope. Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC), 293-302, 2009.
46. [MN08] J. Matoušek and J. Nešetřil: An Invitation to Discrete Mathematics. Oxford: Clarendon Press, 2008.
47. [Pad73] M.W. Padberg: On the Facial Structure of Set Packing Polyhedra. Mathematical Programming 5(1), 199-215, 1973.
48. [Sch08] G. Schoenebeck: Linear Level Lasserre Lower Bounds for Certain k-CSPs. Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 593-602, 2008.
49. [Tre01] L. Trevisan: Non-Approximability Results for Optimization Problems on Bounded Degree Instances. Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC), 453-461, 2001.
50. [Tul09] M. Tulsiani: CSP Gaps and Reductions in the Lasserre Hierarchy. Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC), 303-312, 2009.
51. [Tuza85] Zs. Tuza: Critical Hypergraphs and Intersecting Set-pair Systems. Journal of Combinatorial Theory (B) 39, 134-145, 1985.
52. [Tuza87] Zs. Tuza: On Two Intersecting Set Systems and k-continuous Boolean functions. Discrete Applied Mathematics 16, 183-185, 1987.