Skip to main content
SpringerLink
Log in

Almost Optimal Solutions for Bin Coloring Problems

  • Conference paper
Algorithms and Computation (ISAAC 2005)

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

Included in the following conference series:

Abstract

In this paper we study two interesting bin coloring problems: Minimum Bin Coloring Problem (MinBC) and Online Maximum Bin Coloring Problem (OMaxBC), motivated from several applications in networking. For the MinBC problem, we first show that it is NP-complete, and then present two near linear time approximation algorithms to achieve almost optimal solutions, i.e., no more than OPT+2 and OPT+1 respectively, where OPT is the optimal solution. For the OMaxBC problem, we first introduce a deterministic 2-competitive greedy algorithm, and then give lower bounds for any deterministic and randomized (against adaptive offline adversary) online algorithms. The lower bounds show that our deterministic algorithm achieves the best possible competitive ratio.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. Coffman, E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: a survey. In: Approximation Algorithms for NP-Hard Problems, pp. 46–93. PWS Publishing Company (1997)

    Google Scholar 

  2. Xu, J., Qiao, C., Li, J., Xu, G.: Efficient burst scheduling algorithms in optical burst-switched networks using geometric techniques. IEEE Journal on Selected Areas in Communications 22, 1796–1811 (2004)

    Article  Google Scholar 

  3. Yoo, M., Qiao, C.: A high speed protocol for bursty traffic in optical networks. In: Proc. SPIE All-Opt. Commun. Syst., vol. 3230, pp. 79–90 (1997)

    Google Scholar 

  4. Krumke, S.O., de Paepe, W.E., Rambau, J., Stougie, L.: Online bin coloring. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol. 2161, pp. 74–85. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  5. Schachnai, H., Tamir, T.: Polynomial time approximation schemes for class-constrained packing problems. In: Jansen, K., Khuller, S. (eds.) APPROX 2000. LNCS, vol. 1913, pp. 238–249. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  6. Shachnai, H., Tamir, T.: On two class-constrained version of the mutiple knapsack problem. Algorithmica 29, 442–467 (2001)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, University at Buffalo, the State University of New York, Buffalo, NY, 14260, USA

    Mingen Lin, Zhiyong Lin & Jinhui Xu

Authors
  1. Mingen Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhiyong Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jinhui Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, City University of Hong Kong, Tat Chee Avenue, Kowloon , Hong Kong

    Xiaotie Deng

  2. Department of Computer Science, University of Texas at Dallas, EE/CS Building, 75083, Richardson, TX, USA

    Ding-Zhu Du

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lin, M., Lin, Z., Xu, J. (2005). Almost Optimal Solutions for Bin Coloring Problems. In: Deng, X., Du, DZ. (eds) Algorithms and Computation. ISAAC 2005. Lecture Notes in Computer Science, vol 3827. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11602613_10

Download citation

  • DOI: https://doi.org/10.1007/11602613_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30935-2

  • Online ISBN: 978-3-540-32426-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation