Online two-dimensional vector packing with advice

DOI10.1007/978-3-030-75242-2_27OpenAlexW3158056478MaRDI QIDQ2692736

Gordana Vujovic, Bengt J. Nilsson

Publication date: 22 March 2023

Full work available at URL: https://arxiv.org/abs/2204.10322

zbMATH Keywords

competitive analysisbin packingadvice complexityonline computationvector packing

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Online bin packing with advice
• New lower bounds for certain classes of bin packing algorithms
• Online algorithms with advice for bin packing and scheduling problems
• Bin packing can be solved within 1+epsilon in linear time
• Resource constrained scheduling as generalized bin packing
• Fast algorithms for bin packing
• Online bin packing with advice of small size
• On the Advice Complexity of Online Problems
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
• Packing Small Vectors
• Beating the Harmonic Lower Bound for Online Bin Packing
• On Multidimensional Packing Problems
• The optimal absolute ratio for online bin packing
• Tight bounds for online vector bin packing

This page was built for publication: Online two-dimensional vector packing with advice