Abstract
A batch is a set of jobs that start execution at the same time; only when the last job is completed can the next batch be started. When there are constraints or conflicts between the jobs, we need to ensure that jobs in the same batch be non-conflicting. That is, we seek a coloring of the conflict graph. The two most common objectives of schedules and colorings are the makespan, or the maximum job completion time, and the sum of job completion times. This gives rise to two types of batch coloring problems: max-coloring and batch sum coloring, respectively.
We give the first polynomial time approximation schemes for batch sum coloring on several classes of ”non-thick” graphs that arise in applications. This includes paths, trees, partial k-trees, and planar graphs. Also, we give an improved O(n log n) exact algorithm for the max-coloring problem on paths.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baker, B.S.: Approximation algorithms for NP-hard problems on Planar Graphs. J. of the ACM 41, 153–180 (1994)
Bar-Noy, A., Bellare, M., Halldórsson, M.M., Shachnai, H., Tamir, T.: On chromatic sums and distributed resource allocation. Inf. Comput. 140(2), 183–202 (1998)
Bar-Noy, A., Halldórsson, M.M., Kortsarz, G., Salman, R., Shachnai, H.: Sum multicoloring of graphs. J. of Algorithms 37(2), 422–450 (2000)
Bazgan, C.: Approximation schemes and parameterized complexity. PhD thesis, INRIA, Orsay, France (1995)
Bodlaender, H.L., Koster, A.M.: Combinatorial Optimization on Graphs of Bounded Treewidth. The Computer Journal (2007), doi:10.1093/comjnl/bxm037
Brucker, P.: Scheduling Algorithms, 4th edn. Springer, Heidelberg (2004)
Cesati, M., Trevisan, L.: On the Efficiency of Polynomial Time Approximation Schemes. Information Processing Letters 64, 165–171 (1997)
Epstein, L., Levin, A.: On the max coloring problem. In: Proc. of WAOA (2007)
Epstein, L., Halldórsson, M.M., Levin, A., Shachnai, H.: Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs. Algorithmica (to appear)
Escoffier, B., Monnot, J., Paschos, V.T.: Weighted Coloring: Further complexity and approximability results. Inf. Process. Lett. 97(3), 98–103 (2006)
Gandhi, R., Halldórsson, M.M., Kortsarz, G., Shachnai, H.: Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria. ACM Transactions on Algorithms (to appear)
Guan, D.J., Zhu, X.: A Coloring Problem for Weighted Graphs. Inf. Process. Lett. 61(2), 77–81 (1997)
Halldórsson, M.M., Kortsarz, G.: Tools for Multicoloring with Applications to Planar Graphs and Partial k-Trees. J. Algorithms 42(2), 334–366 (2002)
Halldórsson, M. M., Shachnai, H.: Batch Coloring Flat Graphs and Thin. full version. http://www.cs.technion.ac.il/~hadas/PUB/batch_col.pdf
Han, C.-C., Hou, C.-J., Shin, K.J.: On slot reuse for isochronous services in DQDB networks. In: Proc. of 16th IEEE Real-Time Systems Symposium, pp. 222–231 (1995)
Liu, H., Beck, M., Huang, J.: Dynamic Co-Scheduling of Distributed Computation and Replication. In: Proc. of CCGRID, pp. 592–600 (2006)
Mihail, M., Kaklamanis, C., Rao, S.: Efficient Access to Optical Bandwidth. In: Proc. of FOCS 1995, pp. 548–557 (1995)
Peek, B.R.: High performance optical network architecture. In: All-Optical Networking: Existing and Emerging Architecture and Applications (2002)
Pemmaraju, S.V., Raman, R.: Approximation Algorithms for the Max-coloring Problem. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1064–1075. Springer, Heidelberg (2005)
Smith, W.E.: Various optimizers for single-stage production. Naval Research Logistics Quarterly 3, 59–66 (1956)
Tanenbaum, A.S.: Distributed Operating Systems. Prentice-Hall, Englewood Cliffs (1995)
West, D.B.: Graph Theory, 2nd edn. Prentice-Hall, Englewood Cliffs (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Halldórsson, M.M., Shachnai, H. (2008). Batch Coloring Flat Graphs and Thin. In: Gudmundsson, J. (eds) Algorithm Theory – SWAT 2008. SWAT 2008. Lecture Notes in Computer Science, vol 5124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69903-3_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-69903-3_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69900-2
Online ISBN: 978-3-540-69903-3
eBook Packages: Computer ScienceComputer Science (R0)