An approximation algorithm for maximum triangle packing

We present a randomized (89/169 - e)-approximation algorithm for the weighted maximum triangle packing problem, for any given e > 0. This is the first algorithm for this problem whose performance guarantee is better than ½. The algorithm also improves the best-known approximation bound for the maximum 2-edge path packing problem.

[1]  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..

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

[3]  Refael Hassin,et al.  Better approximations for max TSP , 2000, Inf. Process. Lett..

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

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

[6]  B. Korte,et al.  An Analysis of the Greedy Heuristic for Independence Systems , 1978 .

[7]  Joseph F. Pekny,et al.  A Staged Primal-Dual Algorithm for Finding a Minimum Cost Perfect Two-Matching in an Undirected Graph , 1994, INFORMS J. Comput..

[8]  Miroslav Chleb ´ ik,et al.  Approximation Hardness for Small Occurrence Instances of NP-Hard Problems , 2003 .

[9]  Refael Hassin,et al.  An Approximation Algorithm for Maximum Packing of 3-Edge Paths , 1997, Inf. Process. Lett..

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

[11]  Barun Chandra,et al.  Greedy local improvement and weighted set packing approximation , 2001, SODA '99.

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

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

[14]  R. Ravi,et al.  Nonoverlapping Local Alignments (weighted Independent Sets of Axis-parallel Rectangles) , 1996, Discret. Appl. Math..

[15]  Tomás Feder,et al.  Partition into k-vertex subgraphs of k-partite graphs , 2006, Electron. Colloquium Comput. Complex..