Approximation Results for the Optimum Cost Chromatic Partition Problem
Author:
- Klaus JansenKJKlaus Jansen
- 1 January 2000
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 34 (1) , 54-89
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- Algorithmic aspects of the generalized clique-transversal problem on chordal graphsDiscrete Applied Mathematics, 1996
- Scheduling with incompatible jobsDiscrete Applied Mathematics, 1994
- Approximation Algorithms for Fixed Job Schedule ProblemsOperations Research, 1992
- Fixed Job Scheduling with Two Types of ProcessorsOperations Research, 1992
- The Fixed Job Schedule Problem with Working-Time ConstraintsOperations Research, 1989
- The Fixed Job Schedule Problem with Spread-Time ConstraintsOperations Research, 1987
- Scheduling jobs with fixed start and end timesDiscrete Applied Mathematics, 1987
- Algorithms for maximum k‐colorings and k‐coverings of transitive graphsNetworks, 1987
- On chain and antichain families of a partially ordered setJournal of Combinatorial Theory, Series B, 1980
- SUR UN THEOREMS DU TYPE KÖNIG POUR HYPERGRAPHESAnnals of the New York Academy of Sciences, 1970