Note: 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, Saitama 350-0394, Japan;Department of Mathematical Sciences, Tokyo Denki University, Hatoyama, Saitama 350-0394, Japan;Department of Computer Science, City University of Hong Kong, Tat Chee Avenue, Kowloon, Hong Kong
Venue:
Discrete Applied Mathematics
Year:
2009

Citing 3
Cited 2

Maximum bounded 3-dimensional matching is MAX SNP-complete

Information Processing Letters
An approximation algorithm for maximum triangle packing

Discrete Applied Mathematics
Approximation hardness for small occurrence instances of NP-hard problems

CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity

Multiplying pessimistic estimators: deterministic approximation of max TSP and maximum triangle packing

COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Deterministic approximation algorithms for the maximum traveling salesman and maximum triangle packing problems

Discrete Applied Mathematics

Quantified Score

Hi-index	0.04

Visualization

Abstract

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 4383(1-@e)(~0.518(1-@e)) for any constant @e0. 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-@e) for any constant @e0.