Zobrazeno 1 - 10
of 153
pro vyhledávání: '"Square packing in a square"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Kameng Nip, Zhenbo Wang
Publikováno v:
Journal of Combinatorial Optimization. 34:1198-1209
In this paper, we study a bin packing problem in which the sizes of items are determined by k linear constraints, and the goal is to decide the sizes of items and pack them into a minimal number of unit sized bins. We first provide two scenarios that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f1646ca9bb7ece87e99044846f8c1eaa
https://doi.org/10.1007/s10878-017-0140-2
https://doi.org/10.1007/s10878-017-0140-2
Publikováno v:
Discrete Optimization. 23:20-32
In this paper, we consider the online strip packing problem, in which a list of online rectangles has to be packed without overlap or rotation into one or more strips of width 1 and infinite height so as to minimize the required height of the packing
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ce534aee62f2aad1b667275918fdba47
https://doi.org/10.1016/j.disopt.2016.11.004
https://doi.org/10.1016/j.disopt.2016.11.004
Publikováno v:
Theoretical Computer Science. 661:56-64
We study the parameterized complexity of Minimum Volume Packing and Strip Packing . In the two dimensional version the input consists of a set of rectangles S with integer side lengths. In the Minimum Volume Packing problem, given a set of rectangles
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::22db8cffef6201b78614a20062c4ab82
https://doi.org/10.1016/j.tcs.2016.11.034
https://doi.org/10.1016/j.tcs.2016.11.034
Publikováno v:
Information and Computation. 249:110-120
In this paper we establish an algorithmic framework between bin packing and strip packing, with which strip packing can be very well approximated by applying some bin packing algorithms. More precisely we obtain the following results: (1) Any off-lin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4d90bc6c22926bc238b7c541c856ad2d
https://doi.org/10.1016/j.ic.2016.03.010
https://doi.org/10.1016/j.ic.2016.03.010
Publikováno v:
Journal of Combinatorial Optimization. 33:1411-1420
In this paper we consider the online problem of packing a list of squares into one strip of width 1 and infinite length without overlap so as to minimize the required height of the packing. We derive an upper bound 5 on the competitive ratio for this
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a0e24bf1c7dab4a72d4e85ebeae3e2d2
https://doi.org/10.1007/s10878-016-0046-4
https://doi.org/10.1007/s10878-016-0046-4
Publikováno v:
European Journal of Operational Research. 250:754-759
In this paper, we consider the online strip packing problem, in which a list of online rectangles has to be packed without overlap or rotation into a strip of width 1 and infinite length so as to minimize the required height of the packing. We derive
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9b5927255d2b52542c112684a4767f6a
https://doi.org/10.1016/j.ejor.2015.10.012
https://doi.org/10.1016/j.ejor.2015.10.012
Publikováno v:
Algorithmica. 77:867-901
In 1967, Moon and Moser proved a tight bound on the critical density of squares in squares: any set of squares with a total area of at most 1/2 can be packed into a unit square, which is tight. The proof requires full knowledge of the set, as the alg
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d7cae78935cc9bd8b58ae957374dfef7
https://doi.org/10.1007/s00453-016-0114-2
https://doi.org/10.1007/s00453-016-0114-2
Autor:
Janusz Januszewski, Paulina Grzegorek
Publikováno v:
Information Processing Letters. 115:872-876
A 3.883-competitive online square packing algorithm with one active bin is described. We study the problem of online packing of squares into bins with only one active bin.We describe a new one-space bounded packing algorithm.We improve upper bounds o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::37444809f9b7c3108617ba94d160489f
https://doi.org/10.1016/j.ipl.2015.06.001
https://doi.org/10.1016/j.ipl.2015.06.001
Autor:
Xin Han, Deshi Ye, Yung H. Tsin, Chung Keung Poon, Hing-Fung Ting, Francis Y. L. Chin, Yong Zhang
Publikováno v:
Theoretical Computer Science. 554:135-149
In this paper, we study 1-space bounded 2-dimensional bin packing and square packing. A sequence of rectangular items (square items) arrive one by one, each item must be packed into a square bin of unit size on its arrival without any information abo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::615df1ca6b9243e756b59b32b456c6e2
https://doi.org/10.1016/j.tcs.2014.02.045
https://doi.org/10.1016/j.tcs.2014.02.045