Mutual exclusion scheduling

Theoretical Computer Science

Volumn 162, Issue 2, 1996, Pages 225-243

  Baker, Brenda S ^a   Coffman Jr , Edward G ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; GRAPH THEORY; HEURISTIC METHODS; PARTIAL DIFFERENTIAL EQUATIONS; POLYNOMIALS;

DOMAIN DECOMPOSITION; MUTUAL EXCLUSION SCHEDULING;

SCHEDULING;

EID: 0030212248     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(96)00031-X     Document Type: Article

References (12)

1. N. Alon and N. Kahale, A spectral technique for coloring random 3-colorable graphs, in: Proc. 26th Ann. ACM Symp. on the Theory of Computing (1994) 346-365.
2. K. Appel and W. Haken, Every planar map is four colourable, part i: discharging. Illinois J. Math. 21 (1977) 429-490.
3. B.S. Baker, Approximation algorithms for np-complete problems on planar graphs, J. ACM 41 (1994) 153-180.
4. B. Berger and J. Rompel, A better performance guarantee for approximate graph coloring, Algorithmica 5 (1990) 459-466.
5. P. Bjørstad, W.M. Coughran, Jr. and E. Grosse., parallel domain decomposition applied to coupled transport equations, in: D.E. Keys and J. Xu, eds., Dpmain Decomposition Methods in Scientific and Engineering Computing (American Mathematical Society, Providence, RI, 1995) 369-380.
6. H.L. Bodlaender and K. Jansen, Restrictions of graph partition problems, part i, Tech. Report ruu-cs-91-44, Department of Computer Science, Utrecht University, Utrecht, Netherlands, 1991.
7. H.L. Bolaender, K. Jansen and G.J. Woeginger, Scheduling with incopatible jobs, Discrete Appl. Math. 55 (1994) 219-232.
8. M.R. Garey and D.S. Johnson, Computers and Itractability: A Guide to the Theory of NP-Completeness (W.H. Freeman, New York, 1979).
9. Harry, Graph Theory (Addison-Wesley, Reading, MA 1969).
10. Z. Lone, On the complexity of some chain and anti-chain partition problems, in: WG Conf. (1991) 97-104.
11. C. Lund and M. Yannakakis, On the hardness of approximating minimization problems, in: Proc. 25th Ann. ACM Symp. on the Theory of Computing (1993) 286-293.
12. D.J. Welsh and M.B. Powell, An upper bound for the chromatic number of a graph and its application to time-tabling problems, Computer J. 10 (1967) 85-86.