Erratum to "An improved randomized approximation algorithm for maximum triangle packing" [Discrete Appl. Math. 157 (2009) 1640-1646] (DOI:10.1016/j.dam.2008.11.009);An improved randomized approximation algorithm for maximum triangle packing

Discrete Applied Mathematics

Volumn 157, Issue 7, 2009, Pages 1640-1646

  Chen, Zhi Zhong ^a   Tanahashi, Ruka ^a   Wang, Lusheng ^b  

^a TOKYO DENKI UNIVERSITY   (Japan)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Approximation algorithms; Maximum triangle packing; Maximum weight b matching; Randomized algorithms

Indexed keywords

POLYNOMIAL APPROXIMATION;

B-MATCHING; POLYNOMIAL TIME APPROXIMATION ALGORITHMS; RANDOMIZED ALGORITHMS; RANDOMIZED APPROXIMATION; TRIANGLE PACKING PROBLEM;

APPROXIMATION ALGORITHMS;

EID: 61849148305     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2010.01.011     Document Type: Erratum

References (3)

1. Chlebík M., and Chlebíková J. Approximating hardness for small occurrence instances of NP-hard problems. Proceedings of the 5th Conference on Algorithms and Complexity, CIAC 2003. Lecture Notes in Computer Science vol. 2653 (2003) 152-164
2. Hassin R., and Rubinstein S. An approximation algorithm for maximum triangle packing. Discrete Applied Mathematics 154 (2006) 971-979 Erratum:Discrete Applied Mathematics, 154, (2006) 2620-2620
3. Kann V. Maximum bounded 3-dimensional matching Is MAX SNP-complete. Information Processing Letters 37 (1991) 27-35