On online algorithms for bin, strip, and box packing, and their worst-case and average-case analysis
From MaRDI portal
Publication:2217210
DOI10.1134/S0361768819080036zbMath1455.68279OpenAlexW2894007805WikidataQ126357744 ScholiaQ126357744MaRDI QIDQ2217210
D. O. Lazarev, Nikolaj Nikolaevich Kuzyurin
Publication date: 18 December 2020
Published in: Programming and Computer Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0361768819080036
Analysis of algorithms (68W40) Combinatorial optimization (90C27) Online algorithms; streaming algorithms (68W27)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Shelf algorithms for on-line strip packing
- On-line hierarchical job scheduling on grids with admissible allocation
- Online multiple-strip packing
- An on-line algorithm for multidimensional bin packing
- On optimal matchings
- The average-case analysis of some on-line algorithms for bin packing
- An improved lower bound for on-line bin packing algorithms
- Packings in two dimensions: Asymptotic average-case analysis of algorithms
- Resource constrained scheduling as generalized bin packing
- Multidimensional on-line bin-packing: An algorithm and its average-case analysis
- Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms
- Secure cloud computing based on threshold homomorphic encryption
- Probabilistic analysis of a new class of strip packing algorithms
- A new upper bound 2.5545 on 2D Online Bin Packing
- On the online bin packing problem
- Shelf Algorithms for Two-Dimensional Packing Problems
- New Algorithms for Bin Packing
- Orthogonal Packings in Two Dimensions
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- Strip Packing vs. Bin Packing
- On-line algorithms for packing rectangles into several strips
- Approximate algorithms to pack rectangles into several strips
- A Simple Proof of the $O( \sqrt{n} \log^{3 / 4} n )$ Upright Matching Bound
- Parallel Processing and Applied Mathematics
This page was built for publication: On online algorithms for bin, strip, and box packing, and their worst-case and average-case analysis
