Multi-coloring trees

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

Volumn 1627, Issue , 1999, Pages 271-280

  Halldórsson, Magnús M ^a,e   Kortsarz, Guy ^b   Proskurowski, Andrzej ^c   Salman, Ravit ^d   Shachnai, Hadas ^d   Telle, Jan Arne ^e  

^a UNIVERSITY OF ICELAND   (Iceland)

^b OPEN UNIVERSITY OF ISRAEL   (Israel)

^c UNIVERSITY OF OREGON   (United States)

^d TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^e UNIVERSITY OF BERGEN   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMBINATORIAL MATHEMATICS; POLYNOMIAL APPROXIMATION;

COLORING PROBLEMS; NON-PREEMPTIVE; POLYNOMIAL TIME APPROXIMATION SCHEMES; QUADRATIC ALGORITHMS; SCHEDULING JOBS; SUM OF COMPLETION TIME;

FORESTRY;

EID: 22644449071     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48686-0_27     Document Type: Conference Paper

References (14)

1. B92.
2. M. Bell. Future directions in traffic signal control. Transportation Research Part A, 26:303-313, 1992.
3. BBH+98. 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. BKH+98. A. Bar-Noy, M. M. Halldórsson, G. Kortsarz, H. Shachnai, and R. Salman. Sum Multi-Coloring of Graphs. Proceedings of the Fifth Annual European Symposium on Algorithms, Prague, July 1999.
5. BK98. A. Bar-Noy and G. Kortsarz. The minimum color-sum of bipartite graphs. Journal of Algorithms, 28:339-365, 1998.
6. CCO93. J. Chen, I. Cidon and Y. Ofek. A local fairness algorithm for gigabit LANs/MANs with spatial reuse. IEEE Journal on Selected Areas in Communications, 11:1183-1192, 1993.
7. DO85. K. Daikoku and H. Ohdate. Optimal Design for Cellular Mobile Systems. IEEE Trans. on Veh. Technology, VT-34:3-12, 1985.
8. FK96. U. Feige and J. Kilian. Zero Knowledge and the Chromatic number. Journal of Computer and System Sciences, 57(2):187-199, October 1998.
9. J97.K. Jansen. The Optimum Cost Chromatic Partition Problem. Proc. Of the Third Italian Conference on Algorithms and Complexity (CIAC '97). LNCS 1203, 1997.
10. K89.E. Kubicka. The Chromatic Sum of a Graph. PhD thesis, Western Michigan University, 1989.
11. L81. N. Lynch. Upper Bounds for Static Resource Allocation in a Distributed System. J. of Computer and System Sciences, 23:254-278, 1981.
12. SP88. E. Steyer and G. Peterson. Improved Algorithms for Distributed Resource Allocation. Proceedings of the Seventh Annual Symposium on Principles of Distributed Computing, pp. 105-116, 1988.
13. SG98. A. Silberschatz and P. Galvin. Operating System Concepts. Addison-Wesley, 5th Edition, 1998.
14. Y73. W. R. Young. Advanced Mobile Phone Service, Introduction, Background and Objectives. Bell Systems Technical Report, 58:1-14, 1973.