A short proof of the NP-completeness of minimum sum interval coloring

Operations Research Letters

Volumn 33, Issue 4, 2005, Pages 382-384

  Marx, Dániel ^a  

^a BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

Author keywords

Chromatic sum; Computational complexity; Graph coloring; Interval graph; Minimum sum coloring

Indexed keywords

COLORING; GRAPH THEORY; POLYNOMIALS; PROBLEM SOLVING; TREES (MATHEMATICS); VLSI CIRCUITS;

CHROMATIC SUM; GRAPH COLORING; INTERVAL GRAPH; MINIMUM SUM COLORING;

COMPUTATIONAL COMPLEXITY;

EID: 14844292094     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2004.07.006     Document Type: Article

References (10)

1. A. Bar-Noy, M. Bellare, M.M. Halldórsson, H. Shachnai, and T. Tamir On chromatic sums and distributed resource allocation Inform. Comput. 140 2 1998 183 202
2. A. Bar-Noy, and G. Kortsarz Minimum color sum of bipartite graphs J. Algorithms 28 2 1998 339 365
3. M.R. Garey, D.S. Johnson, G.L. Miller, and C.H. Papadimitriou The complexity of coloring circular arcs and chords SIAM J. Algebraic Discrete Methods 1 2 1980 216 227
4. M.M. Halldórsson, and G. Kortsarz Tools for multicoloring with applications to planar graphs and partial k-trees J. Algorithms 42 2 2002 334 366
5. E. Kubicka, The chromatic sum of a graph, Ph.D. Thesis, Western Michigan University, MI, 1989.
6. E. Kubicka, and A.J. Schwenk An introduction to chromatic sums Proceedings of the ACM Computer Science Conference 1989 Springer Berlin 15 21
7. M. Malafiejski The complexity of the chromatic sum problem on cubic planar graphs and regular graphs J.H. Hajo Broersma Ulrich Faigle S. Pickl Electronic Notes in Discrete Mathematics vol. 8 2001 Elsevier Amsterdam
8. K.J. Supowit Finding a maximum planar subset of nets in a channel IEEE Trans. Comput. Aided Design 6 1 1987 93 94
9. T. Szkaliczki Routing with minimum wire length in the dogleg-free Manhattan model is NP-complete SIAM J. Comput. 29 1 1999 274 287
10. A. Tucker An efficient test for circular-arc graphs SIAM J. Comput. 9 1 1980 1 24