The Optimal Cost Chromatic Partition problem for trees and interval graphs
- 1 January 1997
- conference paper
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 279-292
- https://doi.org/10.1007/3-540-62559-3_23
Abstract
No abstract availableThis publication has 20 references indexed in Scilit:
- Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed timesEuropean Journal of Operational Research, 1993
- Approximation Algorithms for Fixed Job Schedule ProblemsOperations Research, 1992
- Fixed Job Scheduling with Two Types of ProcessorsOperations Research, 1992
- On the computational complexity of (maximum) class schedulingEuropean Journal of Operational Research, 1991
- The Fixed Job Schedule Problem with Working-Time ConstraintsOperations Research, 1989
- Geometric Algorithms and Combinatorial OptimizationAlgorithms and Combinatorics, 1988
- The Fixed Job Schedule Problem with Spread-Time ConstraintsOperations Research, 1987
- Scheduling jobs with fixed start and end timesDiscrete Applied Mathematics, 1987
- The Complexity of Coloring Circular Arcs and ChordsSIAM Journal on Algebraic Discrete Methods, 1980
- On certain polytopes associated with graphsJournal of Combinatorial Theory, Series B, 1975