An approximation algorithm for maximum triangle packing

R. Hassin; S. Rubinstein

doi:10.1007/978-3-540-30140-0_37

An approximation algorithm for maximum triangle packing

R. Hassin, S. Rubinstein

School of Mathematical Sciences

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-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 language	English
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Editors	Susanne Albers, Tomasz Radzik
Publisher	Springer Verlag
Pages	403-413
Number of pages	11
ISBN (Print)	3540230254, 9783540230250
DOIs	https://doi.org/10.1007/978-3-540-30140-0_37
State	Published - 2004

Publication series

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

Access to Document

10.1007/978-3-540-30140-0_37

Cite this

Hassin, R., & Rubinstein, S. (2004). An approximation algorithm for maximum triangle packing. In S. Albers, & T. Radzik (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 403-413). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3221). Springer Verlag. https://doi.org/10.1007/978-3-540-30140-0_37

Hassin, R. ; Rubinstein, S. / An approximation algorithm for maximum triangle packing. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). editor / Susanne Albers ; Tomasz Radzik. Springer Verlag, 2004. pp. 403-413 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inbook{c8ce6cd5d1ab44329a3e034d2013999e,

title = "An approximation algorithm for maximum triangle packing",

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.",

author = "R. Hassin and S. Rubinstein",

year = "2004",

doi = "10.1007/978-3-540-30140-0_37",

language = "אנגלית",

isbn = "3540230254",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "403--413",

editor = "Susanne Albers and Tomasz Radzik",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

Hassin, R & Rubinstein, S 2004, An approximation algorithm for maximum triangle packing. in S Albers & T Radzik (eds), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3221, Springer Verlag, pp. 403-413. https://doi.org/10.1007/978-3-540-30140-0_37

An approximation algorithm for maximum triangle packing. / Hassin, R.; Rubinstein, S.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ed. / Susanne Albers; Tomasz Radzik. Springer Verlag, 2004. p. 403-413 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3221).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

TY - CHAP

T1 - An approximation algorithm for maximum triangle packing

AU - Hassin, R.

AU - Rubinstein, S.

PY - 2004

Y1 - 2004

N2 - 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.

AB - 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.

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

U2 - 10.1007/978-3-540-30140-0_37

DO - 10.1007/978-3-540-30140-0_37

M3 - פרק

AN - SCOPUS:26844491363

SN - 3540230254

SN - 9783540230250

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 403

EP - 413

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

A2 - Albers, Susanne

A2 - Radzik, Tomasz

PB - Springer Verlag

ER -

Hassin R, Rubinstein S. An approximation algorithm for maximum triangle packing. In Albers S, Radzik T, editors, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag. 2004. p. 403-413. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-540-30140-0_37

An approximation algorithm for maximum triangle packing

Abstract

Publication series

Access to Document

Other files and links

Fingerprint

Cite this