The optimal cost chromatic partition problem for trees and interval graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1197 LNCS, Issue , 1997, Pages 279-292

  Kroon, Leo G ^a   Sen, Arunabha ^b   Deng, Haiyong ^c   Roy, Asim ^d  

^a ERASMUS UNIVERSITY ROTTERDAM   (Netherlands)

^b Arizona State University   (United States)

^c INTEL CORPORATION   (United States)

^d ARIZONA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COEFFICIENT MATRIX; FIXED INTERVALS; INTEGER LINEAR PROGRAMS; INTERSECTION GRAPH; LINEAR-TIME ALGORITHMS; PARTITION PROBLEM; POLYNOMIAL-TIME; PROCESSING COSTS;

COMPUTER SCIENCE; COSTS; FORESTRY; GRAPHIC METHODS; INTEGER PROGRAMMING; OPTIMIZATION; POLYNOMIAL APPROXIMATION;

TREES (MATHEMATICS);

EID: 84896784966     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62559-3_23     Document Type: Conference Paper

References (25)

1. E.M. Arkin, and E.L. Silverberg. Scheduling jobs with fixed start and finish times. Discrete Applied Mathematics, 18 (1987), 1-8.
2. C. Berge. Färbung von Graphen deren sämtliche bzw. deren ungerade Kreise starr sind. Wiss. Z. M artin-Luther Univ. Halle-Wittenberg. Math.-Natur. Reihe, 114 (1961).
3. V. Chvatal. On certain polytopes associated with graphs. J. Comb. Theory, B-18 (1975) 138-154.
4. V.R. Dondeti, and H. Emmons. Job scheduling with processors of two types. Operations Research, 40 (1992) S76-S85.
5. V.R. Dondeti, and H. Emmons. Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times. European Journal of Operational Research, 70 (1993) 316-326.
6. M. Fischetti, S. Martello, and P. Toth. The Fixed Job Schedule Problem with spread time constraints. Operations Research, 6 (1987) 849-858.
7. M. Fischetti, S. Martello, and P. Toth. The Fixed Job Schedule Problem with working time constraints. Operations Research, 3 (1989) 395-403.
8. M. Fischetti, S. Martello and P. Toth. Approximation algorithms for Fixed Job Schedule Problems. Operations Research, 40 (1992) S96-S108.
9. M.R. Garey, and D.S. Johnson. Computers and intractability: A guide to the theory of NP-Completeness. Freeman, San Fransisco, 1979.
10. M.R. Garey, D.S. Johnson, G.L. Miller and C.H. Papadimitriou. The complexity of coloring circular arcs and chords. SIAM Journal of Alg. Disc. Meth, 1 (1980) 216-227.
11. C. Grinstead. The perfect graph conjecture for toroidal graphs. Annals of Discrete Mathematics, 21 (1984) 97-101.
12. M. Grötschel, L. Lovasz, and A. Schrijver. Geometric algorithms and combinatorial optimization, (1988). Springer Verlag.
13. A.W.J. Kolen, and L.G. Kroon. On the computational complexity of (maximum) class scheduling. European Journal of Operational Research, 54 (1991), 23-38.
14. A.W.J. Kolen, and L.G. Kroon. Licence Class Design: complexity and algorithms. European Journal of Operational Research, 63 (1992), 432-444.
15. A.W.J. Kolen, and L.G. Kroon. On the computational complexity of (maximum) shift class scheduling. European Journal of Operational Research, 64 (1993), 138-151.
16. A.W.J. Kolen, and L.G. Kroon. Analysis of shift class design problems. European Journal of Operational Research, 79 (1994). 417-430.
17. E. Kubicka, and A. Schwenk. Introduction to chromatic sums. Proc. ACM Computer Science Conference, (1989).
18. M.W. Padberg. Perfect Zero-One matrices. Mathematical Programming, 6 (1974) 180-196.
19. 1,3-free graphs. J. Comb. Theory, B-21 (1976) 212-223.
20. A. Sen, H. Deng, and S. Guha. On a graph partition problem with an application to VLSI layout. Information Processing Letters, 43 (1991) 87-94.
21. A. Sen, H. Deng, and A. Roy. On a graph partition problem with application to multiprocessor scheduling. TR-92-020, Department of Computer Science and Engineering, Arizona State University.
22. K.J. Supowit. Finding a maximum planar subset of a set of nets in a channel. IEEE Trans, on Computer Aided Design, CAD 6, 1 (1987) 93-94.
23. A. Tucker. The Strong Perfect Graph Conjecture for planar graphs. Canad. J. Math, 25 (1973) 103-114.
24. A. Tucker. The validity of the perfect graph conjecture for iQ-free graphs. Annals of Discrete Mathematics, 21 (1984) 149-157.
25. M. Yanakakis, and F. Gavril. The maximum k-colorable subgraph problem for chordal graphs. Information Processing Letters, 24 (1987), 133-137.