Minimizing average completion of dedicated tasks and interval graphs

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

Volumn 2129, Issue , 2015, Pages 114-126

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

^a UNIVERSITY OF ICELAND   (Iceland)

^b DECODE GENETICS   (Iceland)

^c OPEN UNIVERSITY OF ISRAEL   (Israel)

^d TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COLORING; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; OPTIMIZATION; PROBLEM SOLVING; RANDOM PROCESSES; SCHEDULING;

BEST APPROXIMATIONS; COLORING PROBLEMS; CONSTANT FACTOR APPROXIMATION; DEDICATED PROCESSORS; MULTIPLE MACHINE; POLYNOMIALLY SOLVABLE; SUBGRAPH PROBLEMS; SUM OF COMPLETION TIME;

APPROXIMATION ALGORITHMS;

EID: 84923106699     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (17)

1. F. Afrati, E. Bampis, A. Fishkin, K. Jansen, and C. Kenyon. Scheduling to minimize the average completion time of dedicated tasks. In FSTTCS 2000, LNCS, Delhi.
2. A. Bar-Noy and G. Kortsarz. The minimum color-sum of bipartite graphs. Journal of Algorithms, 28:339–365, 1998.
3. 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.
4. D. Bullock and C. Hendrickson. Roadway traffic control software. IEEE Transactions on Control Systems Technology, 2:255–264, 1994.
5. A. Bar-Noy, M. M. Halldórsson, G. Kortsarz. Tight Bound for the Sum of a Greedy Coloring. Information Processing Letters, 1999.
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, November 2000.
7. 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.
8. A. Frank. On Chain and Antichain Families of a Partially Ordered Set. J. Combinatorial Theory, Series B, 29: 176–184, 1980.
9. M. Gonen, Coloring Problems on Interval Graphs and Trees. M.Sc. Thesis. School of Computer Science, The Open Univ., Israel, 2001.
10. M. M. Halldórsson and G. Kortsarz. Multicoloring Planar Graphs and Partial k-trees. In Proceedings of the Second International Workshop on Approximation algorithms (APPROX’99). Lecture Notes in Computer Science Vol. 1671, Springer-Verlag, August 1999.
11. M. M. Halldórsson, G. Kortsarz, A. Proskurowski, R. Salman, H. Shachnai, and J. A. Telle. Multi-Coloring Trees. In Proceedings of the Fifth InternationalComputing and Combinatorics Conference (COCOON), Tokyo, Japan, Lecture Notes in Computer Science Vol. 1627, Springer-Verlag, July 1999.
12. K. Jansen. The Optimum Cost Chromatic Partition Problem. Proc. Of the Third Italian Conference on Algorithms and Complexity (CIAC’97). LNCS 1203, 1997.
13. E. Kubicka. The Chromatic Sum of a Graph. PhD thesis, Western Michigan University, 1989.
14. M. Kubale. Preemptive versus nonpreemptive scheduling of biprocessor tasks on dedicated processors. European Journal of Operational Research94:242–251, 1996.
15. S. Nicoloso, M. Sarrafzadeh and X. Song. On the Sum Coloring Problem on Interval Graphs. Algorithmica, 23:109–126,1999.
16. G. Woeginger. Private communication, 1997.
17. M. Yannakakis and F. Gavril. The maximum k-colorable subgraph problem for chordal graphs. Inform. Proc. Letters, 24:133–137, 1987.