Packing triangles in bounded degree graphs

Information Processing Letters

Volumn 84, Issue 4, 2002, Pages 175-180

  Caprara, Alberto ^a   Rizzi, Romeo ^b  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b AARHUS UNIVERSITY   (Denmark)

Author keywords

APX hardness; NP hardness; Packing triangles; Planar graphs; Polynomial algorithm

Indexed keywords

ALGORITHMS; GRAPH THEORY; POLYNOMIALS; PROBLEM SOLVING;

PACKING TRAINGLES;

DATA PROCESSING;

EID: 0037202493     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(02)00274-0     Document Type: Article

References (12)

1. Ausiello G., Crescenzi P., Gambosi G., Kann V., Marchetti-Spaccamela A., Protasi M. Combinatorial Optimization Problems and Their Approximability Properties. 1999;Springer, Berlin.
2. Bafna V., Pevzner P.A. Genome rearrangements and sorting by reversals. SIAM J. Comput. 25:1996;272-289.
3. Berman P., Karpinski M. On some tighter inapproximability results, ECCC Report No. 29. 1998;University of Trier.
4. Baker B.S. Approximation algorithms for NP-complete problems on planar graphs. J. ACM. 41:1994;153-180.
5. B.S. Baker, Personal communication, 2001.
6. Caprara A., Panconesi A., Rizzi R. Packing cycles in undirected graphs, Working Paper. 2001;University of Bologna.
7. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-completeness. 1979;Freeman, San Francisco, CA.
8. Holyer I. The NP-completeness of some edge-partition problems. SIAM J. Comput. 10:1981;713-717.
9. Hurkens C.A.J., Schrijver A. 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.
10. Kann V. Maximum bounded 3-dimensional matching is MAX SNP-complete. Inform. Process. Lett. 37:1991;27-35.
11. Lichtenstein D. Planar formulae and their uses. SIAM J. Comput. 11:1982;329-343.
12. Minty G.J. On maximal independent sets of vertices in claw-free graphs. J. Combin. Theory Ser. B. 28:1980;284-304.