Sum coloring interval and κ-claw free graphs with application to scheduling dependent jobs

Algorithmica (New York)

Volumn 37, Issue 3, 2003, Pages 187-209

  Halldórsson, Magnús M ^a   Kortsarz, Guy ^b   Shachnai, Hadas ^c,d  

^a UNIVERSITY OF ICELAND   (Iceland)

^b RUTGERS UNIVERSITY   (United States)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^d LUCENT TECHNOLOGIES   (United States)

Author keywords

Approximation algorithms; Multicoloring; Scheduling dependent jobs; Sum coloring

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; JOB ANALYSIS; SCHEDULING;

MULTICOLORING; SUM COLORING;

GRAPH THEORY;

EID: 0242489508     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-003-1031-8     Document Type: Article

References (30)

1. F. Afrati, E. Bampis, A. Fishkin, K. Jansen, and C. Kenyo. Scheduling to minimize the average completion time of dedicated tasks. Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, Vol. 1974, pages 454-464, 2000.
2. A. Bar-Noy, M. Bellare, M. M. Halldórsson, H. Shachnai, and T. Tamir. On chromatic sums and distributed resource allocation. Information and Computation, 140:183-202, 1998.
3. E. Bampis, M. Caramia, J. Fiala, A. Fishkin, and A. Iovanella. Scheduling of independent dedicated multiprocessor jobs. Proceedings of the 13th Annual International Symposium on Algorithms and Computation (ISAAC), Lecture Notes in Computer Science, Vol. 2518, pages 391-402, 2002.
4. H. L. Bodlaender and B. De Fluiter. Parallel algorithms for series parallel graphs. Proceedings of the 4th European Symposium on Algorithms, Lecture Notes in Computer Science, Vol. 1136, pages 277-289, 1996.
5. A. Bar-Noy, S. Guha, J. Naor, and B. Schieber. Approximating the throughput of multiple machines in real-time scheduling. SIAM Journal on Computing, 31:331-352, 2001.
6. A. Bar-Noy, M. M. Halldórsson, G. Kortsarz, H. Shachnai, and R. Salman. Sum multicoloring of graphs. Journal of Algorithms, 37(2):422-450, 2000.
7. A. Bar-Noy, M. M. Halldórsson, and G. Kortsarz. Tight bound for the sum of a greedy coloring. Information Processing Letters, 71:135-140, 1999.
8. A. Bar-Noy and G. Kortsarz. The minimum color-sum of bipartite graphs. Journal of Algorithms, 28:339-365, 1998.
9. P. Brucker and A. Krämer. Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems. European Journal of Operational Research, 90:214-226, 1996.
10. E. G. Coffman, Jr., M. R. Garey, D. S. Johnson, and A. S. LaPaugh. Scheduling file transfers. SIAM Journal on Computing, 14:744-780, 1985.
11. S. Chakrabarti, C. A. Phillips, A. S. Schulz, D. B. Shmoys, C. Stein, and J. Wein. Improved scheduling algorithms for Minsum criteria. Proceedings of the 23rd International Colloquium on Automata, Languages and Programming (ICALP), pages 875-886, 1996.
12. C. Flotow. On powers of m-trapezoid graphs. Discrete Applied Mathematics, 63:187-192, 1995.
13. A. Frank. On chain and antichain families of a partially ordered set. Journal of Combinatorial Theory, Series B, 29:176-184, 1980.
14. A. V. Fishkin, K. Jansen, and L. Porkolab. On minimizing average weighted completion time of multiprocessor tasks with release dates. Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP), pages 875-886, 2001.
15. S. Felsner, R. Müller, and L. Wernisch. Trapezoid graphs and generalizations, geometry and algorithms. Discrete Applied Mathematics, 74:13-32, 1997.
16. M. C. Golumbic. Algorithmic Group Theory and Perfect Graphs. Academic Press, New York, 1980.
17. M. Gonen. Coloring Problems on Interval Graphs and Trees. M.Sc. thesis, School of Computer Science, The Open University, Tel-Aviv, 2001.
18. K. Giaro, R. Janczewski, M. Kubale, and M. Malafiejski. A 27/26-approximation algorithm for the chromatic sum coloring of bipartite graphs. Proceedings of the 5th International Workshop on Approximation Algorithms (APPROX), pages 135-145, 2002.
19. M. M. Halldórsson and G. Kortsarz. Multicoloring planar graphs and partial k-trees. Proceedings of the Second International Workshop on Approximation Algorithms (APPROX). Lecture Notes in Computer Science, Vol. 1671, pages 73-84, 1999.
20. M. M. Halldórsson, G. Kortsarz, A. Proskurowski, R. Salman, H. Shachnai, and J. A. Telle. Multicoloring trees. Proceedings of the Fifth International Computing and Combinatorics Conference (COCOON), Lecture Notes in Computer Science, Vol. 1627, pages 271-280, 1999.
21. R. Hassin and S. Rubinstein. Robust matchings and maximum clustering. SIAM Journal of Discrete Mathematics, 15:530-537, 2002.
22. K. Jansen. The optimum cost chromatic partition problem. Proceedings of the Third Italian Conference on Algorithms and Complexity (CIAC'97), Lecture Notes in Computer Science, Vol. 1203, pages 25-36, 1997.
23. Y. A. Kim. Data migration to minimize the average completion time. Proceedings of the 14th Symposium on Discrete Algorithms (SODA), pages 97-98, 2003.
24. E. Kubicka. The Chromatic Sum of a Graph. Ph.D. thesis, Western Michigan University, 1989.
25. M. Kubale. Preemptive versus non-preemptive scheduling of biprocessor tasks on dedicated processors. European Journal of Operational Research, 94:242-251, 1996.
26. E. Kubicka, G. Kubicki, and D. Kountanis. Approximation algorithms for the chromatic sum. Proceedings of the First Great Lakes Computer Science Conference, Lecture Notes in Computer Science, Vol. 1203, pages 15-21, 1989.
27. M. V. Marathe, H. Breau, H. B. Hunt III, S. S. Ravi, and D. J. Rosenkrantz. Simple heuristics for unit disk graphs. Networks, 25:59-68, 1995.
28. S. Nicoloso, M. Sarrafzadeh, and X. Song. On the sum coloring problem on interval graphs. Algorithmica, 23:109-126, 1999.
29. G. Woeginger. Private communication, 1997.
30. M. Yannakakis and F. Gavril. The maximum k-colorable subgraph problem for chordal graphs. Information Processing Letters, 24:133-137, 1987.