Approximation algorithms and hardness results for the clique packing problem

Electronic Notes in Discrete Mathematics

Volumn 29, Issue SPEC. ISS., 2007, Pages 397-401

  Chataigner, F ^a   Manic G ^a   Wakabayashi, Y ^a   Yuster, R ^b  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

^b UNIVERSITY OF HAIFA   (Israel)

Author keywords

Approximation algorithms; APX hardness; clique; packing; triangle

Indexed keywords

EID: 34547700503     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/j.endm.2007.07.065     Document Type: Article

References (5)

1. Caprara A., and Rizzi R. Packing triangles in bounded degree graphs. Inform. Process. Lett. 84 4 (2002) 175-180
2. Halldórsson M. Approximating k-set cover and complementary graph coloring. Lecture Notes in Computer Science 1084 (1996) 118-131
3. Hell P., and Kirkpatrick D.G. Packings by cliques and by finite families of graphs. Discrete Math. 49 1 (1984) 45-59
4. Hurkens C.A.J., and 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 1 (1989) 68-72
5. Manić G., and Wakabayashi Y. Packing triangles in low degree graphs and indifference graphs. DMTCS AE (2005) 251-256