A 4/3 OPT+2/3 approximation for big two-bar charts packing problem
From MaRDI portal
Publication:6147752
DOI10.1007/s10958-023-06319-yarXiv2212.00944OpenAlexW4323045613MaRDI QIDQ6147752
No author found.
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/2212.00944
Cites Work
- Unnamed Item
- There is no asymptotic PTAS for two-dimensional vector packing
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- A 71/60 theorem for bin packing
- Bin packing can be solved within 1+epsilon in linear time
- 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
- Resource constrained scheduling as generalized bin packing
- The proof of \(\text{FFD}(L)\leq\frac{11}9\text{OPT}(L)+\frac79\)
- 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
- Approximation and online algorithms for multidimensional bin packing: a survey
- Complex Scheduling
- The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9
- A new proof for the first-fit decreasing bin-packing algorithm
- Optimal Investment in the Development of Oil and Gas Field
- A Posteriori Analysis of the Algorithms for Two-Bar Charts Packing Problem
- An improved approximation for packing big two-bar charts
This page was built for publication: A 4/3 OPT+2/3 approximation for big two-bar charts packing problem
