Online two-dimensional vector packing with advice
From MaRDI portal
Publication:2692736
DOI10.1007/978-3-030-75242-2_27OpenAlexW3158056478MaRDI QIDQ2692736FDOQ2692736
Authors: Gordana Vujovic, Bengt J. Nilsson 
Publication date: 22 March 2023
Full work available at URL: https://arxiv.org/abs/2204.10322
Cites Work
- Title not available (Why is that?)
- Bin packing can be solved within 1+epsilon in linear time
- Online bin packing with advice
- On the Advice Complexity of Online Problems
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- New lower bounds for certain classes of bin packing algorithms
- Online algorithms with advice for bin packing and scheduling problems
- Fast algorithms for bin packing
- On Multidimensional Packing Problems
- Resource constrained scheduling as generalized bin packing
- Title not available (Why is that?)
- The optimal absolute ratio for online bin packing
- Title not available (Why is that?)
- Beating the harmonic lower bound for online bin packing
- Tight bounds for online vector bin packing
- Packing small vectors
- Online bin packing with advice of small size
This page was built for publication: Online two-dimensional vector packing with advice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2692736)
