Sciweavers

Share
AAIM
2008
Springer

An Improved Randomized Approximation Algorithm for Maximum Triangle Packing

11 years 11 months ago
An Improved Randomized Approximation Algorithm for Maximum Triangle Packing
This paper deals with the maximum triangle packing problem. For this problem, Hassin and Rubinstein gave a randomized polynomial-time approximation algorithm that achieves an expected ratio of 43 83 (1− ) (≈ 0.518(1− )) for any constant > 0. By modifying their algorithm, we obtain a new randomized polynomial-time approximation algorithm for the problem which achieves an expected ratio of 0.5257(1 − ) for any constant > 0.
Zhi-Zhong Chen, Ruka Tanahashi, Lusheng Wang
Added 01 Jun 2010
Updated 01 Jun 2010
Type Conference
Year 2008
Where AAIM
Authors Zhi-Zhong Chen, Ruka Tanahashi, Lusheng Wang
Comments (0)
books