Multicoloring Planar Graphs and Partial k-Trees

We study the multicoloring problem with two objective functions: minimizing the makespan and minimizing the multisum. We focus on partial k-trees and planar graphs. In particular, we give polynomial time approximation schemes (PTAS) for both classes, for both preemptive and non-preemptive multisum colorings.

[1]  Michael G.H. Bell,et al.  FUTURE DIRECTIONS IN TRAFFIC SIGNAL CONTROL , 1992 .

[2]  Uriel Feige,et al.  Zero Knowledge and the Chromatic Number , 1998, J. Comput. Syst. Sci..

[3]  Ewa Kubicka,et al.  An introduction to chromatic sums , 1989, CSC '89.

[4]  Guy Kortsarz,et al.  Minimum Color Sum of Bipartite Graphs , 1998, J. Algorithms.

[5]  Dionysios Kountanis,et al.  Approximation Algorithms for the Chromatic Sum , 1989, Great Lakes Computer Science Conference.

[6]  B. Reed,et al.  Channel Assignment and Weighted Coloring , 2000 .

[7]  Guy Kortsarz,et al.  Multi-coloring Trees , 1999, COCOON.

[8]  Eugene Styer,et al.  Improved algorithms for distributed resource allocation , 1988, PODC '88.

[9]  Brenda S. Baker,et al.  Approximation algorithms for NP-complete problems on planar graphs , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[10]  Paul Erdös,et al.  Tight bounds on the chromatic sum of a connected graph , 1989, J. Graph Theory.

[11]  Lata Narayanan,et al.  Static Frequency Assignment in Cellular Networks , 2001, Algorithmica.

[12]  Abraham Silberschatz,et al.  Operating System Concepts , 1983 .

[13]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[14]  Tibor Szkaliczki,et al.  Routing with Minimum Wire Length in the Dogleg-Free Manhattan Model is NP-Complete , 1999, SIAM J. Comput..

[15]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.

[16]  Guy Kortsarz,et al.  Sum Multi-coloring of Graphs , 1999, ESA.

[17]  Yoram Ofek,et al.  A Local Fairness Algorithm for Gigabit LAN's/MAN's with Spatial Reuse , 1993, IEEE J. Sel. Areas Commun..

[18]  Majid Sarrafzadeh,et al.  On the Sum Coloring Problem on Interval Graphs , 1999, Algorithmica.

[19]  Klaus Jansen,et al.  The Optimum Cost Chromatic Partition Problem , 1997, CIAC.

[20]  Darcy M. Bullock,et al.  Roadway traffic control software , 1994, IEEE Trans. Control. Syst. Technol..

[21]  Mihir Bellare,et al.  On Chromatic Sums and Distributed Resource Allocation , 1998, Inf. Comput..

[22]  Jordan Gergov,et al.  Approximation Algorithms for Dynamic Storage Allocation , 1996 .

[23]  H. Bodlaender.  Planar graphs with bounded treewidth , 1988 .

[24]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[25]  Guy Kortsarz,et al.  The Minimum Color Sum of Bipartite Graphs , 1997, ICALP.