Partition into cliques for cubic graphs: Planar case, complexity and approximation

Discrete Applied Mathematics

Volumn 156, Issue 12, 2008, Pages 2270-2278

  Cerioli, M R ^a   Faria, L ^b   Ferreira, T O ^a   Martinhon, C A J ^c   Protti, F ^a   Reed, B ^d  

^a FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^b STATE UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^c FLUMINENSE FEDERAL UNIVERSITY   (Brazil)

^d MCGILL UNIVERSITY   (Canada)

Author keywords

Approximation; Coloring; Cubic planar graphs; Max SNP hard; NP complete; Partition into cliques

Indexed keywords

CHLORINE COMPOUNDS;

APPROXIMATION; COLORING; CUBIC GRAPHS; CUBIC PLANAR GRAPHS; DECISION PROBLEMS; DISJOINT SUBSETS; GRAPH G; MAX SNP-HARD; NP-COMPLETE; PARTITION INTO CLIQUES; POSITIVE INTEGERS;

GRAPH THEORY;

EID: 49149121876     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2007.10.015     Document Type: Article

References (15)

1. Ausiello G., Crescenzi P., Gambosi G., Kann V., Marchetti-Sccamela A., and Protasi M. Complexity and Approximation (Combinatorial Optimization Problems and their Approximability Properties) (1999), Springer, Berlin
2. Bellare M., Goldreich O., and Sudan M. Free bits, PCPs and non-approximability - towards tight results. SIAM J. Comput. 27 (1998) 804-915
3. P. Berman, M. Karpinski, A.D. Scott, Approximation hardness and satisfiability of bounded occurrence instances of SAT, in: Electronic Colloquium on Computational Complexity, ECCC, 2003
4. Brooks R.L. On colouring nodes of a network. Proc. Cambridge Philos. Soc. 37 (1941) 194-197
5. Edmonds J. Paths, trees and flowers. Canad. J. Math. 17 (1965) 449-467
6. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), W. H. Freeman & Company
7. Garey M.R., Johnson D.S., and Stockmeyer L. Some simplified NP-complete graph problems. Theoret. Comput. Sci. 1 (1976) 237-267
8. Halldórsson M.M. A still better performance guarantee for approximate graph coloring. Inform. Process. Lett. 45 (1993) 19-23
9. M.M. Halldórsson, Approximating k-set cover and complementary graph coloring. in: Proc. 5th Conference on Integer Programming and Combinatorial Optimization, IPCO'1996, 1996, pp. 118-131
10. Hunt III H.B., Marathe M.V., Radhakrishnan V., and Stearns R.E. The complexity of planar counting problems. SIAM J. Comput. 27 4 (1998) 1142-1167
11. Karp R.M. Reducibility among combinatorial problems. In: Miller R.E., and Thatcher J.W. (Eds). Complexity of Computer Computations (1972), Plenum Press 85-103
12. S. Khanna, Motwani, Towards a syntactic characterization of PTAS, in: 28th ACM Symp. on Theory of Computing, STOC'96, 1996, pp. 329-337
13. Lichtenstein D. Planar formulae and their uses. SIAM J. Comput. 43 (1982) 329-393
14. Papadimitriou C.H., and Yannakakis M. Optimization, approximation, and complexity classes. J. Comput. System Sci. 43 (1991) 425-440
15. Papadimitriou C.H. Computational Complexity (1994), Addison-Wesley