An improved approximation for packing big two-bar charts
From MaRDI portal
Publication:6187994
DOI10.1007/s10958-022-06151-warXiv2101.00470OpenAlexW3120801490MaRDI QIDQ6187994
V. V. Shenmaier, Adil I. Erzin
Publication date: 1 February 2024
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2101.00470
Related Items (1)
Cites Work
- Unnamed Item
- A \((5/3+\varepsilon)\)-approximation for strip packing
- A 71/60 theorem for bin packing
- A 2.5 times optimal algorithm for packing in two dimensions
- A simple proof of the inequality \(\text{FFD}(L)\leq {11 \over 9} \text{OPT}(L)+1\), \(\forall L\) for the FFD bin-packing algorithm
- The proof of \(\text{FFD}(L)\leq\frac{11}9\text{OPT}(L)+\frac79\)
- Maximum ATSP with weights zero and one via half-edges
- An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing
- A simple proof of the inequality \(MFFD(L)\leq {71\over 60}\text{OPT}(L)+1,L\) for the \(MFFD\) bin-packing algorithm
- A 3/2-approximation for big two-bar charts packing
- Two-bar charts packing problem
- A branch-and-price algorithm for the two-dimensional vector packing problem
- Approximation and online algorithms for multidimensional bin packing: a survey
- The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9
- Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems
- A new proof for the first-fit decreasing bin-packing algorithm
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- Orthogonal Packings in Two Dimensions
- A Strip-Packing Algorithm with Absolute Performance Bound 2
- Improved Approximation for Vector Bin Packing
- Optimal Investment in the Development of Oil and Gas Field
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
This page was built for publication: An improved approximation for packing big two-bar charts
