Standard

Three-Bar Charts Packing Problem. / Erzin, Adil; Sharankhaev, Konstantin.

Communications in Computer and Information Science. Vol. 1739 Springer Science and Business Media Deutschland GmbH, 2022. p. 61-75.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

Harvard

Erzin, A & Sharankhaev, K 2022, Three-Bar Charts Packing Problem. in Communications in Computer and Information Science. vol. 1739, Springer Science and Business Media Deutschland GmbH, pp. 61-75. https://doi.org/10.1007/978-3-031-22990-9_5

APA

Erzin, A., & Sharankhaev, K. (2022). Three-Bar Charts Packing Problem. In Communications in Computer and Information Science (Vol. 1739, pp. 61-75). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-22990-9_5

Vancouver

Erzin A, Sharankhaev K. Three-Bar Charts Packing Problem. In Communications in Computer and Information Science. Vol. 1739. Springer Science and Business Media Deutschland GmbH. 2022. p. 61-75 doi: 10.1007/978-3-031-22990-9_5

Author

Erzin, Adil ; Sharankhaev, Konstantin. / Three-Bar Charts Packing Problem. Communications in Computer and Information Science. Vol. 1739 Springer Science and Business Media Deutschland GmbH, 2022. pp. 61-75

BibTeX

@inproceedings{052fd79611254c34b100ef27a8afb2a3,
title = "Three-Bar Charts Packing Problem",
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.",
author = "Adil Erzin and Konstantin Sharankhaev",
note = "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”).",
year = "2022",
doi = "10.1007/978-3-031-22990-9_5",
language = "English",
isbn = "978-3-031-22989-3",
volume = "1739",
pages = "61--75",
booktitle = "Communications in Computer and Information Science",
publisher = "Springer Science and Business Media Deutschland GmbH",
address = "Germany",

}

RIS

TY - GEN

T1 - Three-Bar Charts Packing Problem

AU - Erzin, Adil

AU - Sharankhaev, Konstantin

N1 - 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”).

PY - 2022

Y1 - 2022

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

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

UR - https://www.scopus.com/inward/record.url?eid=2-s2.0-85148047119&partnerID=40&md5=14d8952e9bb426cef74520eeddc3cc5b

UR - https://www.mendeley.com/catalogue/8207274a-f427-351e-819f-42d3594da4ed/

U2 - 10.1007/978-3-031-22990-9_5

DO - 10.1007/978-3-031-22990-9_5

M3 - Conference contribution

SN - 978-3-031-22989-3

VL - 1739

SP - 61

EP - 75

BT - Communications in Computer and Information Science

PB - Springer Science and Business Media Deutschland GmbH

ER -

ID: 45612433