TY - JOUR

T1 - An approximation algorithm for maximum triangle packing

AU - Hassin, Refael

AU - Rubinstein, Shlomi

PY - 2006/4/15

Y1 - 2006/4/15

N2 - We present a randomized (89169-ε)-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 12. The algorithm also improves the best-known approximation bound for the maximum 2-edge path packing problem.

AB - We present a randomized (89169-ε)-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 12. The algorithm also improves the best-known approximation bound for the maximum 2-edge path packing problem.

KW - 2-edge paths

KW - Analysis of algorithms

KW - Maximum triangle packing

UR - http://www.scopus.com/inward/record.url?scp=33644752838&partnerID=8YFLogxK

U2 - 10.1016/j.dam.2005.11.003

DO - 10.1016/j.dam.2005.11.003

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:33644752838

SN - 0166-218X

VL - 154

SP - 971

EP - 979

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

IS - 6

ER -