Skip to main content
SpringerLink
Log in

Three-Bar Charts Packing Problem

  • Conference paper
  • First Online:
Advances in Optimization and Applications (OPTIMA 2022)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1739))

Included in the following conference series:

  • 224 Accesses

Abstract

Three-Bar Charts Packing Problem is to pack the bar charts consisting of three bars each into the horizontal unit-height strip of minimal length. The bars of each bar chart may move vertically within the strip, but it is forbidden to change the order and separate the bars. For this novel issue, which is a generalization of the strongly NP-hard Two-Bar Charts Packing Problem considered earlier, we propose several approximation algorithms with guaranteed accuracy.

The research was supported by the Russian Science Foundation (grant No. 22-71-10063 “Development of intelligent tools for optimization multimodal flow assignment systems in congested networks of heterogeneous products").

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 54.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.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

References

  1. Complete Proof of Theorem 2: https://drive.google.com/drive/folders/ 1SLUye20gBVaOWI4YM8z72sgDytJTHs63?usp=sharing

  2. Baker, B.S.: A new proof for the first-fit decreasing bin-packing algorithm. J. Algorithms 6, 49–70 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bansal, N., Eliás, M., Khan, A.: Improved approximation for vector bin packing. In: SODA, pp. 1561–1579 (2016)

    Google Scholar 

  4. Bläser, M.: A 3/4-approximation algorithm for maximum ATSP with weights zero and one. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) APPROX/RANDOM -2004. LNCS, vol. 3122, pp. 61–71. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-27821-4_6

    Chapter  MATH  Google Scholar 

  5. Blaser, M.: An 8/13-approximation algorithm for the maximum asymmetric TSP. J. Algorithms 50(1), 23–48 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  6. Christensen, H.I., Khanb, A., Pokutta, S., Tetali, P.: Approximation and online algorithms for multidimensional bin packing: a survey. Comput. Sci. Rev. 24, 63–79 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  7. Dósa, G.: The tight bound of first fit decreasing bin-packing algorithm is \(FFD(I) \le 11/9~OPT(I) + 6/9\). In: Chen, B., Paterson, M., Zhang, G. (eds.) ESCAPE 2007. LNCS, vol. 4614, pp. 1–11. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-74450-4_1

    Chapter  Google Scholar 

  8. Erzin, A., Plotnikov, R., Korobkin, A., Melidi, G., Nazarenko, S.: Optimal investment in the development of oil and gas field. In: Kochetov, Y., Bykadorov, I., Gruzdeva, T. (eds.) MOTOR 2020. CCIS, vol. 1275, pp. 336–349. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-58657-7_27

    Chapter  MATH  Google Scholar 

  9. Erzin, A., Melidi, G., Nazarenko, S., Plotnikov, R.: Two-bar charts packing problem. Optim. Lett. 15(6), 1955–1971 (2021)

    Article  MathSciNet  MATH  Google Scholar 

  10. Erzin, A., Melidi, G., Nazarenko, S., Plotnikov, R.: A 3/2-approximation for big two-bar charts packing. J. Comb. Optim. 42(1), 71–84 (2021). https://doi.org/10.1007/s10878-021-00741-1

    Article  MathSciNet  MATH  Google Scholar 

  11. Erzin, A., Shenmaier, V.: An improved approximation for packing big two-bar charts. J. Math. Sci. 267(4), 465–473 (2022). https://doi.org/10.1007/s10958-022-06151-w

  12. Gabow, H.: An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems. In: STOC, pp. 448–456 (1983)

    Google Scholar 

  13. Garey, M.R., David, S.J.: Computers and Intractability; A Guide to the Theory of NP-Completeness. p. 339 (1979)

    Google Scholar 

  14. Johnson, D.S.: Near-optimal bin packing algorithms. Ph.D thesis, Massachusetts Institute of Technology (1973)

    Google Scholar 

  15. Johnson, D.S., Garey, M.R.: A 71/60 theorem for bin packing. J. Complex. 1(1), 65–106 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  16. Kellerer, H., Kotov, V.: An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing. Oper. Res. Lett. 31, 35–41 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  17. Li, R., Yue, M.: The proof of \(FFD(L)\le 11/9 OPT(L)+7/9\). Chin. Sci. Bull. 42(15), 1262–1265 (1997)

    Article  MathSciNet  Google Scholar 

  18. Paluch, K.: Maximum ATSP with weights zero and one via half-edges. Theory Comput. Syst. 62(2), 319–336 (2018)

    Article  MathSciNet  MATH  Google Scholar 

  19. Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2003). https://doi.org/10.1007/978-3-662-04565-7

    Book  Google Scholar 

  20. Yue, M.: A simple proof of the inequality \(FFD(L)\le 11/9 OPT(L)+1, \forall L\), for the FFD bin-packing algorithm. Acta Math. Appl. Sin. 7(4), 321–331 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  21. Yue, M., Zhang, L.: A simple proof of the inequality \(MFFD(L)\le 71/60 OPT(L)+1, \forall L\), for the MFFD bin-packing algorithm. Acta Math. Appl. Sin. 11(3), 318–330 (1995)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sobolev Institute of Mathematics, SB RAS, Novosibirsk, 630090, Russia

    Adil Erzin

  2. Novosibirsk State University, Novosibirsk, 630090, Russia

    Adil Erzin & Konstantin Sharankhaev

  3. St. Petersburg State University, St. Petersburg, 199034, Russia

    Adil Erzin

Authors
  1. Adil Erzin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Konstantin Sharankhaev
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Adil Erzin .

Editor information

Editors and Affiliations

  1. FRC CSC RAS, Moscow, Russia

    Nicholas Olenev

  2. FRC CSC RAS, Moscow, Russia

    Yuri Evtushenko

  3. University of Montenegro, Podgorica, Montenegro

    Milojica Jaćimović

  4. Krasovsky Institute of Mathematics and Mechanics, Ekaterinburg, Russia

    Michael Khachay

  5. FRC CSC RAS, Moscow, Russia

    Vlasta Malkova

  6. FRC CSC RAS, Moscow, Russia

    Igor Pospelov

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Erzin, A., Sharankhaev, K. (2022). Three-Bar Charts Packing Problem. In: Olenev, N., Evtushenko, Y., Jaćimović, M., Khachay, M., Malkova, V., Pospelov, I. (eds) Advances in Optimization and Applications. OPTIMA 2022. Communications in Computer and Information Science, vol 1739. Springer, Cham. https://doi.org/10.1007/978-3-031-22990-9_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-22990-9_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-22989-3

  • Online ISBN: 978-3-031-22990-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation