An approximation algorithm for maximum triangle packing

R. Hassin, S. Rubinstein

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

We present a randomized (89/169 - ε)-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 1/2. The algorithm also improves the best known approximation bound for the maximum 2-edge path packing problem. Keywords: Analysis of algorithms, maximum triangle packing, 2-edge paths.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsSusanne Albers, Tomasz Radzik
PublisherSpringer Verlag
Pages403-413
Number of pages11
ISBN (Print)3540230254, 9783540230250
DOIs
StatePublished - 2004

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3221
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

Dive into the research topics of 'An approximation algorithm for maximum triangle packing'. Together they form a unique fingerprint.

Cite this