Abstract
We consider the problem of partitioning interval graphs into cliques of bounded size. Each interval has a weight, and the weight of a clique is the maximum weight of any interval in the clique. This natural graph problem can be interpreted as a batch scheduling problem. Solving a long-standing open problem, we show NP-hardness, even if the bound on the clique sizes is constant. Moreover, we give a PTAS based on a novel dynamic programming technique for this case.
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
Arora, S.: Polynomial time approximation schemes for euclidean traveling salesman and other geometric problems. Journal of the ACM 45(5), 753–782 (1998)
Baptiste, P.: Scheduling unit tasks to minimize the number of idle periods: a polynomial time algorithm for offline dynamic power management. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’06), pp. 364–367 (2006)
Becchetti, L., Korteweg, P., Marchetti-Spaccamela, A., Skutella, M., Stougie, L., Vitaletti, A.: Latency constrained aggregation in sensor networks. In: Proceedings of the 14th Annual European Symposium on Algorithms (ESA’06), pp. 88–99 (2006)
Bodlaender, H.L., Jansen, K.: Restrictions of graph partition problems. part I. Theoretical Computer Science 148(1), 93–109 (1995)
Boudhar, M.: Dynamic scheduling on a single batch processing machine with split compatibility graphs. Journal of Mathematical Modelling and Algorithms 2(1), 17–35 (2003)
Correa, J., Megow, N., Raman, R., Suchan, K.: Cardinality constrained graph partitioning into cliques with submodular costs. In: Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW’09), pp. 347–350 (2009)
Even, G., Levi, R., Rawitz, D., Schieber, B., Shahar, S., Sviridenko, M.: Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs. ACM Transactions on Algorithms 4(3) (2008)
Finke, G., Jost, V., Queyranne, M., Sebö, A.: Batch processing with interval graph compatibilities between tasks. Discrete Applied Mathematics 156(5), 556–568 (2008)
Gijswijt, D., Jost, V., Queyranne, M.: Clique partitioning of interval graphs with submodular costs on the cliques. RAIRO - Operations Research 41(3), 275–287 (2007)
Hochbaum, D.S., Laundy, D.: Scheduling semiconductor burn-in operations to minimize total flowtime. Operations Research 45, 874–885 (1997)
Hochbaum, D.S., Maass, W.: Approximation schemes for covering and packing problems in image processing and VLSI. Journal of the ACM 32(1), 130–136 (1985)
Garey, M.R., Johnson, D.S.: Computers and Intracability, A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)
Pemmaraju, S.V., Raman, R.: Approximation algorithms for the max-coloring problem. In: Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP’05), pp. 1064–1075 (2005)
Pemmaraju, S.V., Raman, R., Varadarajan, K.: Buffer minimization using max-coloring. In: Proceedings of the 15th annual ACM-SIAM Symposium on Discrete Algorithms (SODA’04), pp. 562–571 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nonner, T. (2010). Capacitated max -Batching with Interval Graph Compatibilities. In: Kaplan, H. (eds) Algorithm Theory - SWAT 2010. SWAT 2010. Lecture Notes in Computer Science, vol 6139. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13731-0_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-13731-0_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13730-3
Online ISBN: 978-3-642-13731-0
eBook Packages: Computer ScienceComputer Science (R0)