Imagen de Portada

Updated Estimates for Algorithms for Packing2-Bar Charts in a Strip

Guardado en:
Publicado en:Journal of Applied and Industrial Mathematics vol. 18, no. 4 (Dec 2024), p. 759
Autor principal: Nazarenko, S. A.
Publicado:
Springer Nature B.V.
Materias:
Estimates
Approximation
Algorithms
Linear programming
Packing problem
Charts
Polynomials
Strip
Acceso en línea:Citation/Abstract
Full Text
Full Text - PDF
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
Resumen:We consider a two-bar charts packing problem in which it is necessary to pack bar charts consisting of two bars in a unit-height strip of minimum length. Each bar has a height of at most 1 and unit length. The problem under consideration is NP-hard and generalizes the bin packing problem and two-dimensional vector packing problem. This paper proves updated accuracy estimates and time complexity for several previously developed polynomial approximation algorithms for the two-bar charts packing problem and particular cases of the problem. We show the attainability of the estimates. Furthermore, we consider a problem of packing an unlimited number of bar charts belonging to <inline-graphic specific-use="web" mime-subtype="GIF" xlink:href="11754_2024_5339_Article_IEq1.gif" /> different types and propose a polynomial algorithm to solve the problem in case <inline-graphic specific-use="web" mime-subtype="GIF" xlink:href="11754_2024_5339_Article_IEq2.gif" />.
ISSN:1990-4789
1990-4797
DOI:10.1134/S1990478924040112
Fuente:ABI/INFORM Global