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 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. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Chen, Z. Z., Tanahashi, R., & Wang, L. (2008). An improved randomized approximation algorithm for maximum triangle packing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5034 LNCS, pp. 97–108). https://doi.org/10.1007/978-3-540-68880-8_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
