An approximation algorithm for maximum triangle packing

Authors:
Refael Hassin;Shlomi Rubinstein
Affiliations:
Department of Statistics and Operations Research, Tel Aviv University, Tel Aviv, Israel;Department of Statistics and Operations Research, Tel Aviv University, Tel Aviv, Israel
Venue:
Discrete Applied Mathematics
Year:
2006

Citing 11
Cited 3

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
Maximum bounded 3-dimensional matching is MAX SNP-complete

Information Processing Letters
Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles)

Discrete Applied Mathematics - Special volume on computational molecular biology
An approximation algorithm for maximum packing of 3-edge paths

Information Processing Letters
On Local Search for Weighted K-Set Packing

Mathematics of Operations Research
Approximating discrete collections via local improvements

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Better approximations for max TSP

Information Processing Letters
Greedy local improvement and weighted set packing approximation

Journal of Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A d/2 approximation for maximum weight independent set in d-claw free graphs

Nordic Journal of Computing
Approximation hardness for small occurrence instances of NP-hard problems

CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity

Approximation results for the weighted P4 partition problem

Journal of Discrete Algorithms
Minimum-weight cycle covers and their approximability

Discrete Applied Mathematics
Note: An improved randomized approximation algorithm for maximum triangle packing

Discrete Applied Mathematics

Quantified Score

Hi-index	0.04

Visualization

Abstract

We present a randomized (89/169 - ε)-approximation algorithm for the weighted maximum triangle packing problem, for any given ε 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.