Restrictions of graph partition problems. Part I
Theoretical Computer Science
Approximation schemes for covering and packing problems in image processing and VLSI
Journal of the ACM (JACM)
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Buffer minimization using max-coloring
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Latency constrained aggregation in sensor networks
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Batch processing with interval graph compatibilities between tasks
Discrete Applied Mathematics
Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs
ACM Transactions on Algorithms (TALG)
Approximation algorithms for the max-coloring problem
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Clique clustering yields a PTAS for max-coloring interval graphs
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
| Hi-index | 0.00 |
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.