An Improved Randomized Approximation Algorithm for Maximum Triangle Packing

  • Authors:

  • Zhi-Zhong Chen;Ruka Tanahashi;Lusheng Wang

  • Affiliations:

  • Department of Mathematical Sciences, Tokyo Denki University, Hatoyama, Japan 350-0394;Department of Mathematical Sciences, Tokyo Denki University, Hatoyama, Japan 350-0394;Department of Computer Science, City University of Hong Kong, Hong Kong,

  • Venue:
  • AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper deals with the maximum triangle packing problem. For this problem, Hassin and Rubinstein gave a randomized polynomial-time approximation algorithm and claimed that it achieves an expected ratio of $\frac{89}{169}(1 - \epsilon)$ for any constant 驴 0. However, their analysis was flawed. We present a new randomized polynomial-time approximation algorithm for the problem which achieves an expected ratio very close to their claimed expected ratio.