On NP-hardness of the clique partition - Independence number gap recognition and related problems

Discrete Mathematics

Volumn 306, Issue 4, 2006, Pages 460-463

  Busygin, Stanislav ^a   Pasechnik, Dmitrii V ^b  

^a University of Florida   (United States)

^b GOETHE UNIVERSITY   (Germany)

Author keywords

Clique partition number; Independence number; Latin square; Lov sz number; Quasigroup completion problem

Indexed keywords

COMPUTATION THEORY; GRAPH THEORY; PROBLEM SOLVING; SET THEORY;

CLIQUE PARTITION NUMBER; INDEPENDENCE NUMBER; LATIN SQUARE; LOVÁSZ NUMBER; QUASIGROUP COMPLETION PROBLEM;

NUMBER THEORY;

EID: 33644895968     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2006.01.004     Document Type: Article

References (15)

1. D. Achlioptas, C. Gomes, H. Kautz, B. Selman, Generating satisfiable problem instances, in: Proceedings of the 17th National Conference on Artificial Intelligence (AAAI-00), Austin, TX, 2000.
2. E. Bannai, and T. Ito Algebraic Combinatorics I: Association Schemes 1984 Benjamin/Cummings Menlopark, CA
3. C. Colbourn The complexity of completing partial latin squares Discrete Appl. Math. 8 1984 25 30
4. E. de Klerk, and D. Pasechnik Approximation of the stability number of a graph via copositive programming SIAM J. Optim. 12 4 2001 875 892
5. M. Garey, and D. Johnson Computers and Intractability: A Guide to the Theory of NP-Completeness 1979 Freeman & Co. New York
6. M.X. Goemans Semidefinite programming in combinatorial optimization Math. Programming 79 1997
7. C. Gomes, R. Regis, D. Shmoys, An improved approximation for the partial latin square extension problem, in: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA-2003), Baltimore, MD, 2003.
8. C. Gomes, B. Selman, Problem structure in the presence of perturbations, in: Proceedings of the 14th National Conference on Artificial Intelligence (AAAI-97), New Providence, RI, 1997.
9. C. Gomes, D. Shmoys, Completing quasigroups or latin squares: a structured graph coloring problem, in: Proceedings of the Computational Symposium on Graph Coloring and Extensions, 2002.
10. C. Gomes, and D. Shmoys The promise of LP to boost CSP techniques for combinatorial problems Proceedings of the 4th International Symposium on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR'02) 2002 Le Croisic France 291 305
11. H. Kautz, Y. Ruan, D. Achlioptas, C. Gomes, B. Selman, M. Stickel, Balance and filtering in structured satisfiable problems, in: Proceedings of the 17th International Conference on Artificial Intelligence (IJCAI-2001), Seattle, WA, 2001.
12. D.E. Knuth The Sandwich theorem Electron. J. Combin. 1 1994
13. L. Lovász On the Shannon capacity of a graph IEEE Trans. Inform. Theory 25 1 1979 1 7
14. L. Lovász, and A. Schrijver Cones of matrices and set-functions and 0-1 optimization SIAM J. Optim. 1 2 1991 166 190
15. I. Peterson Completing latin squares Sci. News 19 157 2000