Skip to main content
SpringerLink
Log in

Multi-coloring Trees

  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1627))

Included in the following conference series:

Abstract

Scheduling jobs with pairwise conflicts is modeled by the graph multi-coloring problem. It occurs in two versions: preemptive and non-preemptive. We study these problems on trees under the sum-of-completion-times objective. In particular, we give a quadratic algorithm for the non-preemptive case, and a faster algorithm in the case that all job lengths are short, while we present a polynomial-time approximation scheme for the preemptive case.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Bell. Future directions in traffic signal control. Transportation Research Part A, 26:303–313, 1992.

    Google Scholar 

  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.

    Article  MATH  MathSciNet  Google Scholar 

  3. 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.

    Google Scholar 

  4. A. Bar-Noy and G. Kortsarz. The minimum color-sum of bipartite graphs. Journal of Algorithms, 28:339–365, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  5. 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.

    Article  Google Scholar 

  6. K. Daikoku and H. Ohdate. Optimal Design for Cellular Mobile Systems. IEEE Trans. on Veh. Technology, VT-34:3–12, 1985.

    Article  Google Scholar 

  7. U. Feige and J. Kilian. Zero Knowledge and the Chromatic number. Journal of Computer and System Sciences, 572):187–199, October 1998.

    Article  MATH  MathSciNet  Google Scholar 

  8. K. Jansen. The Optimum Cost Chromatic Partition Problem. Proc. of the Third Italian Conference on Algorithms and Complexity (CIAC '97). LNCS 1203, 1997.

    Google Scholar 

  9. E. Kubicka. The Chromatic Sum of a Graph. PhD thesis, Western Michigan University, 1989.

    Google Scholar 

  10. N. Lynch. Upper Bounds for Static Resource Allocation in a Distributed System. J. of Computer and System Sciences, 23:254–278, 1981.

    Article  MATH  MathSciNet  Google Scholar 

  11. 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.

    Google Scholar 

  12. A. Silberschatz and P. Galvin. Operating System Concepts. Addison-Wesley, 5th Edition, 1998.

    Google Scholar 

  13. W. R. Young. Advanced Mobile Phone Service, Introduction, Background and Objectives. Bell Systems Technical Report, 58:1–14, 1973.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Science Institute, University of Iceland, Reykjavik, Iceland

    Magnús M. Halldórsson

  2. Dept. of Computer Science, Open University, Ramat Aviv, Israel

    Guy Kortsarz

  3. Dept. of Computer Science, University of Oregon, Eugene, Oregon, USA

    Andrzej Proskurowski

  4. Dept. of Mathematics, Technion, Haifa, Israel

    Ravit Salman

  5. Dept. of Computer Science, Technion, Haifa, Israel

    Hadas Shachnai

  6. Dept. of Informatics, University of Bergen, Bergen, Norway

    Magnús M. Halldórsson & Jan Arne Telle

Authors
  1. Magnús M. Halldórsson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Guy Kortsarz
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Andrzej Proskurowski
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ravit Salman
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Hadas Shachnai
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Jan Arne Telle
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Information and System Engineering Faculty of Science and Engineering, Chuo University, 1-13-27, Kasuga, Bunkyo-ku, Tokyo, 112-8551, Japan

    Takano Asano

  2. Department of Information Science, University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo, 113-0033, Japan

    Hideki Imai

  3. Academia Sinica, Institute of Information Science, Nankang, Taipei, Taiwan

    D. T. Lee

  4. Department of Computer Science Faculty of Engineering, Gunma University, 1-5-1 Tenjin-cho, Kiryu, Gunma, 376-8515, Japan

    Shin-ichi Nakano

  5. IBM Tokyo Research Laboratory, 1623-14, Shimo-Tsuruma, Yamato Kanagawa, 242-0001, Japan

    Takeshi Tokuyama

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Halldórsson, M.M., Kortsarz, G., Proskurowski, A., Salman, R., Shachnai, H., Telle, J.A. (1999). Multi-coloring Trees. In: Asano, T., Imai, H., Lee, D.T., Nakano, Si., Tokuyama, T. (eds) Computing and Combinatorics. COCOON 1999. Lecture Notes in Computer Science, vol 1627. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48686-0_27

Download citation

  • DOI: https://doi.org/10.1007/3-540-48686-0_27

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66200-6

  • Online ISBN: 978-3-540-48686-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation