A Randomized Approximation Algorithm for Metric Triangle Packing

Given an edge-weighted complete graph G on 3n vertices, the maximum-weight triangle packing problem (MWTP for short) asks for a collection of n vertex-disjoint triangles in G such that the total weight of edges in these n triangles is maximized. Although MWTP has been extensively studied in the literature, it is surprising that prior to this work, no nontrivial approximation algorithm had been designed and analyzed for its metric case (denoted by MMWTP), where the edge weights in the input graph satisfy the triangle inequality. In this paper, we design the first nontrivial polynomial-time approximation algorithm for MMWTP. Our algorithm is randomized and achieves an expected approximation ratio of \(0.66745 - \epsilon \) for any constant \(\epsilon > 0\).

[1]  Piotr Berman,et al.  A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs , 2000, Nord. J. Comput..

[2]  Harold N. Gabow,et al.  An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs , 1976, JACM.

[3]  Viggo Kann,et al.  Maximum Bounded 3-Dimensional Matching is MAX SNP-Complete , 1991, Inf. Process. Lett..

[4]  Anke van Zuylen.  Deterministic approximation algorithms for the maximum traveling salesman and maximum triangle packing problems , 2013, Discret. Appl. Math..

[5]  C. Pandu Rangan,et al.  The Vertex-Disjoint Triangles Problem , 1998, WG.

[6]  Refael Hassin,et al.  An approximation algorithm for maximum triangle packing , 2006, Discret. Appl. Math..

[7]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8]  Marek Cygan,et al.  Improved Approximation for 3-Dimensional Matching via Bounded Pathwidth Local Search , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[9]  Miroslav Chlebík,et al.  Approximation Hardness for Small Occurrence Instances of NP-Hard Problems , 2003, CIAC.

[10]  Zhi-Zhong Chen,et al.  Erratum to "An improved randomized approximation algorithm for maximum triangle packing" [Discrete Appl. Math. 157 (2009) 1640-1646] , 2010, Discrete Applied Mathematics.

[11]  Yoshiko Wakabayashi,et al.  Packing triangles in low degree graphs and indifference graphs , 2008, Discret. Math..

[12]  Esther M. Arkin,et al.  On Local Search for Weighted k-Set Packing , 1998, Math. Oper. Res..

[13]  Alexander Schrijver,et al.  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 , 1989, SIAM J. Discret. Math..

[14]  Martin Fürer,et al.  Approximating the k -Set Packing Problem by Local Improvements , 2013, ISCO.

[15]  Refael Hassin,et al.  Erratum to "An approximation algorithm for maximum triangle packing": [Discrete Applied Mathematics 154 (2006) 971-979] , 2006, Discret. Appl. Math..

[16]  Hans L. Bodlaender,et al.  Partition Into Triangles on Bounded Degree Graphs , 2012, Theory of Computing Systems.

[17]  Magnús M. Halldórsson,et al.  Approximating discrete collections via local improvements , 1995, SODA '95.

[18]  Zhi-Zhong Chen,et al.  An improved randomized approximation algorithm for maximum triangle packing , 2009, Discret. Appl. Math..