Erratum to "An approximation algorithm for maximum triangle packing". [Discrete Applied Mathematics 154 (2006) 971-979] (DOI:10.1016/j.dam.2005.11.003);An approximation algorithm for maximum triangle packing

Discrete Applied Mathematics

Volumn 154, Issue 6, 2006, Pages 971-979

  Hassin, Refael ^a   Rubinstein, Shlomi ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

2 edge paths; Analysis of algorithms; Maximum triangle packing

Indexed keywords

APPROXIMATION THEORY; PROBLEM SOLVING;

2-EDGE PATHS; ANALYSIS OF ALGORITHMS; MAXIMUM TRIANGLE PACKING;

ALGORITHMS;

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

References (14)

1. E. Arkin, and R. Hassin On local search for weighted packing problems Math. Oper. Res. 23 1998 640 648
2. V. Bafna, B. Narayanan, and R. Ravi Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles) Discrete Appl. Math. 71 1996 41 53
3. P. Berman A d/2 approximation for maximum weight independent set in d -claw free graphs Nordic J. Comput. 7 2000 178 184
4. B. Chandra, and M.M. Halldórsson Greedy local improvement and weighted set packing approximation J. Algorithms 39 2001 223 240
5. M. Chlebík, J. Chlebíková, Approximating hardness for small occurrence instances of NP-hard problems, in: R. Petreschi, G. Parsiano, R. Silvestri (Eds.), Algorithms and Complexity, CIAC 2003, Lecture Notes in Computer Science, vol. 2653, pp. 152-164.
6. T. Feder, C. Subi, Partition into k-vertex subgraphs of k-partite graphs, manuscript, 2004.
7. M.R. Garey, and D.S. Johnson Computers and Intractability: A Guide to the Theory of NP-Completeness 1978 Freeman New York
8. M.M. Halldórsson, Approximating discrete collections via local improvements, in: Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms SODA'95, 1995, pp. 160-169.
9. D. Hartvigsen, Extensions of matching theory, Ph.D. Thesis, Carnegie-Mellon University, 1984.
10. R. Hassin, and S. Rubinstein An approximation algorithm for maximum packing of 3-edge paths Inform. Process. Lett. 63 1997 63 67
11. R. Hassin, and S. Rubinstein Better approximations for Max TSP Inform. Process. Lett. 75 2000 181 186
12. C.A.J. Hurkens, and A. Schrijver On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems SIAM J. Discrete Math. 2 1989 68 72
13. V. Kann Maximum bounded 3-dimensional matching is MAX SNP-complete Inform. Process. Lett. 37 1991 27 35
14. J.F. Pekny, and D.L. Miller A staged primal-dual algorithm for finding a minimum cost perfect two-matching in an undirected graph ORSA J. Comput. 6 1994 68 81