On the sum coloring problem on interval graphs

Algorithmica (New York)

Volumn 23, Issue 2, 1999, Pages 109-126

  Nicoloso, S ^a   Sarrafzadeh, M ^b   Song, X ^c  

^a CNR   (Italy)

^b Northwestern University   (United States)

^c UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

Approximation algorithms; Coloring; Interval graphs; Over the cell routing; VLSI design

Indexed keywords

EID: 0000149232     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009252     Document Type: Article

References (18)

1. Aho, A., J. Hopcroft, and J. Ullman. The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
2. Bar-Noy, A., H. Schachnai, and T. Tamir, The Minimum Color Sum Problem and Distributed Resource Allocation, manuscript, 1995.
3. Erdös, P., E. Kubicka, and A. Schwenk, Graphs That Require Many Colors to Achieve Their Chromatic Sum,Congressus Numerantium 71 (1990), 17-28.
4. Golumbic, M. C., Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
5. Gupta, U., D. T. Lee, and J. Leung, Efficient Algorithms for Interval Graphs and Circular-Arc Graphs, Networks 12 (1982), 459-467.
6. Halldórsson, M., and J. Radhakrishnan, Approximating the Chromatic Sum of a Graph, Report IS-RR-93-0002F. School Information Science, Japan Advanced Institute of Science and Technology, Hokuriku, 1993.
7. Holmes, N., S. Natarajan, N. Sherwani, and M. Sarrafzadeh, Over-the-Cell Channel Routing for High Performance Circuits, Proc. 1992 IEEE Design Automation Conference (DAC '92), pp. 600-603.
8. Kramer, M. R., and J. van Leeuwen, The Complexity of Wire Routing and Finding Minimum Area Layouts for Arbitrary VLSI Circuits, in Advances in Computing Research (VLSI Theory), vol. 2, F. P. Preparata, editor, 1984, JAI Press, Greenwich, CT, and London, England, pp. 129-146.
9. Kubicka, E., The Chromatic Sum of a Graph, Ph.D. Dissertation, Western Michigan University, 1989.
10. Kubicka, E., G. Kubicki, and D. Kountanis, Approximation Algorithms for the Chromatic Sum, Proc. 1st Great Lakes Computer Science Conf., Michigan, October 1989, LNCS 507, Springer-Verlag, Berlin, pp. 15-21.
11. Kubicka, E., and A. J. Schwenk, An Introduction to Chromatic Sum, Proc. ACM 1989 Computer Sci. Conf., pp. 39-45.
12. Nemhauser, G. L., and L. A. Wolsey, Integer and Combinatorial Optimization, Wiley, New York, 1988.
13. Preparata, F., and M. I. Shamos, Computational Geometry: an Introduction, Springer-Verlag, New York, 1986.
14. Richards, D., Complexity of Single-layer Routing, IEEE Transactions on Computers C-33(3) (March 1984), 286-288.
15. Roberts, F. S., Indifference graphs, in Proof Techniques in Graph Theory, F. Harary, editor, Academic Press, New York, 1969, pp. 139-146.
16. Szkaliczki, T., Routing with Minimum Wire Length in the Dogleg-free Manhattan Model is NP-complete, SIAM Journal on Computing, to appear.
17. Supowit, K. J., Finding a Maximum Planar Subset of a Set of Nets in a Channel, IEEE Transactions on Computer Aided Design CAD-6(1) (January 1987), 93-94.
18. Thomassen, C., P. Erdös, Y. Alavi, P. J. Malde, and A. J. Schwenk, Tight Bounds on the Chromatic Sum of a Connected Graph, Journal of Graph Theory 13(3) (1989), 353-357.