Skip to main content
SpringerLink
Log in

Improved Approximation Algorithms for the Max-Edge Coloring Problem

  • Conference paper
Theory and Practice of Algorithms in (Computer) Systems (TAPAS 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6595))

  • 942 Accesses

Abstract

The max edge-coloring problem asks for a proper edge-coloring of an edge-weighted graph minimizing the sum of the weights of the heaviest edge in each color class. In this paper we present a PTAS for trees and an 1.74-approximation algorithm for bipartite graphs; we also adapt the last algorithm to one for general graphs of the same, asymptotically, approximation ratio. Up to now, no approximation algorithm of ratio 2 − δ, for any constant δ> 0, was known for general or bipartite graphs, while the complexity of the problem on trees remains an open question.

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. Anstee, R.P.: An algorithmic proof of Tutte’s f-factor theorem. Journal of Algorithms 6, 112–131 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bourgeois, N., Lucarelli, G., Milis, I., Paschos, V.T.: Approximating the max-edge-coloring problem. Theoretical Computer Science 411, 3055–3067 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  3. de Werra, D., Demange, M., Escoffier, B., Monnot, J., Paschos, V.T.: Weighted coloring on planar, bipartite and split graphs: Complexity and approximation. Discrete Applied Mathematics 157, 819–832 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  4. de Werra, D., Hoffman, A.J., Mahadev, N.V.R., Peled, U.N.: Restrictions and preassignments in preemptive open shop scheduling. Discrete Applied Mathematics 68, 169–188 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  5. Demange, M., de Werra, D., Monnot, J., Paschos, V.T.: Time slot scheduling of compatible jobs. Journal of Scheduling 10, 111–127 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  6. Epstein, L., Levin, A.: On the max coloring problem. In: Kaklamanis, C., Skutella, M. (eds.) WAOA 2007. LNCS, vol. 4927, pp. 142–155. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  7. Escoffier, B., Monnot, J., Paschos, V.T.: Weighted coloring: further complexity and approximability results. Information Processing Letters 97, 98–103 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  8. Finke, G., Jost, V., Queyranne, M., Sebő, A.: Batch processing with interval graph compatibilities between tasks. Discrete Applied Mathematics 156, 556–568 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  9. Gabow, H.N., Nishizeki, T., Kariv, O., Leven, D., Terada, O.: Algorithms for edge-coloring graphs. Technical Report TRECIS-8501, Tohoku University (1985)

    Google Scholar 

  10. Gopal, I.S., Wong, C.: Minimizing the number of switchings in a SS/TDMA system. IEEE Transactions On Communications 33, 497–501 (1985)

    Article  Google Scholar 

  11. Halldorsson, M.M., Shachnai, H.: Batch coloring flat graphs and thin. In: Gudmundsson, J. (ed.) SWAT 2008. LNCS, vol. 5124, pp. 198–209. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  12. Holyer, I.: The NP-completeness of edge-coloring. SIAM Journal on Computing 10, 718–720 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  13. Kavitha, T., Mestre, J.: Max-coloring paths: Tight bounds and extensions. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 87–96. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  14. Kesselman, A., Kogan, K.: Nonpreemptive scheduling of optical switches. IEEE Transactions on Communications 55, 1212–1219 (2007)

    Article  Google Scholar 

  15. König, D.: Über graphen und ihre anwendung auf determinantentheorie und mengenlehre. Mathematische Annalen 77, 453–465 (1916)

    Article  MathSciNet  MATH  Google Scholar 

  16. Kubale, M.: Some results concerning the complexity of restricted colorings of graphs. Discrete Applied Mathematics 36, 35–46 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  17. Lucarelli, G., Milis, I., Paschos, V.T.: On the max-weight edge coloring problem. Journal of Combinatorial Optimization 20, 429–442 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  18. Pemmaraju, S.V., Raman, R.: Approximation algorithms for the max-coloring problem. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1064–1075. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  19. Pemmaraju, S.V., Raman, R., Varadarajan, K.R.: Buffer minimization using max-coloring. In: 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2004), pp. 562–571 (2004)

    Google Scholar 

  20. Vizing, V.G.: On an estimate of the chromatic class of a p-graph. Diskret. Analiz. 3, 25–30 (1964)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LAMSADE, Université Paris-Dauphine and CNRS, France

    Giorgio Lucarelli

  2. Department of Informatics, Athens University of Economics and Business, Greece

    Ioannis Milis

Authors
  1. Giorgio Lucarelli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ioannis Milis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Systemics "Antonio Ruberti", Sapienza University of Rome, Via Ariosto 25, 00185, Rome, Italy

    Alberto Marchetti-Spaccamela

  2. Communication Systems Engineering Department, Ben-Gurion University of the Negev, POB 653, 84105, Beer-Sheva, Israel

    Michael Segal

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lucarelli, G., Milis, I. (2011). Improved Approximation Algorithms for the Max-Edge Coloring Problem. In: Marchetti-Spaccamela, A., Segal, M. (eds) Theory and Practice of Algorithms in (Computer) Systems. TAPAS 2011. Lecture Notes in Computer Science, vol 6595. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19754-3_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-19754-3_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-19753-6

  • Online ISBN: 978-3-642-19754-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation