Sciact
  • EN
  • RU

Three-Bar Charts Packing Problem Full article

Conference XIII International Conference Optimization and Applications
26-30 Sep 2022 , Петровац
Source Advances in Optimization and Applications : 13th International Conference, OPTIMA 2022, Petrovac, Montenegro, September 26–30, 2022, Revised Selected Papers
Compilation, Springer Cham. 2023. 197 c. ISBN 978-3-031-22990-9.
Journal Communications in Computer and Information Science
ISSN: 1865-0929
Output data Year: 2022, Volume: 1739, Pages: 35-47 Pages count : 13 DOI: 10.1007/978-3-031-22990-9_5
Tags Bar charts · Strip packing · Approximation
Authors Erzin A. 1,2 , Sharankhaev K. 2
Affiliations
1 Sobolev Institute of Mathematics
2 Novosibirsk State University

Funding (1)

1 Sobolev Institute of Mathematics FWNF-2022-0019

Abstract: A 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 NP-hard Two-Bar Charts Packing Problem considered earlier, we propose several approximation algorithms with guaranteed estimates.
Cite: Erzin A. , Sharankhaev K.
Three-Bar Charts Packing Problem
In compilation Advances in Optimization and Applications : 13th International Conference, OPTIMA 2022, Petrovac, Montenegro, September 26–30, 2022, Revised Selected Papers. – Springer Cham., 2022. – C.35-47. – ISBN 978-3-031-22990-9. DOI: 10.1007/978-3-031-22990-9_5 Scopus OpenAlex
Dates:
Accepted: Oct 12, 2022
Published print: Jan 1, 2023
Published online: Jan 1, 2023
Identifiers:
Scopus: 2-s2.0-85148047119
OpenAlex: W4313343176
Citing:
DB Citing
Scopus 1
Altmetrics: