Weighted sum coloring in batch scheduling of conflicting jobs

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

Volumn 4110 LNCS, Issue , 2006, Pages 116-127

  Epstein, Leah ^a   Halldórsson, Magnús M ^b   Levin, Asaf ^c   Shachnai, Hadas ^d  

^a UNIVERSITY OF HAIFA   (Israel)

^b UNIVERSITY OF ICELAND   (Iceland)

^c HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^d TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; OPTIMIZATION;

BATCH SCHEDULING; GEOMETRIC PARTITIONING; GREEDY SET COVER ALGORITHM;

PROBLEM SOLVING;

EID: 33750041337     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11830924_13     Document Type: Conference Paper

References (20)

1. A. Bar-Noy, M. Bellare, M. M. Halldórsson, H. Shachnai, and T. Tamir. On chromatic sums and distributed resource allocation. Inf. Comput., 140(2): 183-202, 1998.
2. A. Bar-Noy, M. M. Halldórsson, G. Kortsarz, R. Salman, and H. Shachnai. Sum multicoloring of graphs. J. of Algorithms, 37(2):422-450, 2000.
3. P. Brucker. Scheduling Algorithms 4th ed. Springer-Verlag, 2004.
4. V. Chvátal. A greedy heuristic for the set-covering problem. Mathematics of Operations Research, 4:233-235, 1979.
5. L. Epstein, M. M. Halldórsson, A. Levin and H. Shachnai. Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs, full version, http: //www. cs. technion.ac.i1/~hadas/PUB/cosum.pdf.
6. U. Feige, L. Lovász, and P. Tetali. Approximating min sum set cover. Algorithmica, 40(4):219-234, 2004.
7. A. Frank. On chain and antichain families of a partially ordered set. J. of Combinatorial Theory Series B, 29:176-184, 1980.
8. R. Gandhi R., M. M Halldórsson, G. Kortsarz and H. Shachnai, Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria. In Proc. of WAOA, 2004.
9. M. R. Garey and D. S. Johnson. Computers and intractability. W. H. Freeman and Company, New York, 1979.
10. M. C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, 1980.
11. M. M. Halldórsson, G. Kortsarz, and H. Shachnai. Sum coloring interval and fc-claw free graphs with application to scheduling dependent jobs. Algorithmica, 37(3):187-209, 2003.
12. C. A. J. Hurkens, and A. Schrijver. On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems. SIAM J. Discrete Math., vol. 2, 1989, pp. 68-72.
13. D. S. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 9:256-278, 1974.
14. L. Lovász. On the ratio of optimal integral and fractional covers. Discrete Mathematics, 13:383-390, 1975.
15. K. Munagala, S. Babu, R. Motwani, and J. Widom. The pipelined set cover problem. In Proc. of ICDT 2005.
16. S. Nicoloso, M. Sarrafzadeh, and X. Song. On the sum coloring problem on interval graphs. Algorithmica, 23(2):109-126, 1999.
17. A. Schrijver. Combinatorial optimization polyhedra and efficiency. Springer-Verlag, 2003.
18. W. E. Smith. Various optimizers for single-stage production. Naval Research Logistics Quarterly, 3:59-66, 1956.
19. G. J. Woeginger. When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme (FPTAS)? INFORMS J. on Computing, 12(1):57-74, 2000.
20. M. Yannakakis and F. Gavril. The maximum k-colorable subgraph problem for chordal graphs. Information Processing Letters, 24(2):133-137, 1987.