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. © 2010 Springer-Verlag.
Cite
CITATION STYLE
Nonner, T. (2010). Capacitated max -batching with interval graph compatibilities. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6139 LNCS, pp. 176–187). https://doi.org/10.1007/978-3-642-13731-0_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
