An approximation algorithm for maximum packing of 3-edge paths

Information Processing Letters

Volumn 63, Issue 2, 1997, Pages 63-67

  Hassin, Refael ^a   Rubinstein, Shlomi ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Analysis of algorithms; Maximum set packing

Indexed keywords

EID: 0042174519     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(97)00097-5     Document Type: Article

References (7)

1. E. Arkin and R. Hassin, On local search for weighted k-set packing, 1996.
2. V. Bafna, B. Narayanan and R. Ravi, Nonoverlapping local alignments (weighted independent sets of axis parallel rectangles), in: Proc. Workshop for Algorithms and Data Structures (WADS), 1995.
3. M.L. Fisher, G.L. Nemhauser and L.A. Wolsey, An analysis of approximations for finding a maximum weight Hamiltonian circuit, Oper. Res. 27 (1979) 799-809.
4. J.C. Fournier, Colorations des arêtes d'un graphe, Cahiers Centre Études Rech. Opér. 15 (1973) 311-314.
5. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1978).
6. T.R. Jensen and B. Toft, Graph Coloring Problems (Wiley, New York, 1995).
7. C. Stein, Private communication, May 1997.