Online two-dimensional vector packing with advice

DOI10.1007/978-3-030-75242-2_27MaRDI QIDQ2692736OpenAlexFDO

Authors Gordana Vujovic, Bengt J. Nilsson

Publication date 22 March 2023

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

zbMATH Keywords

competitive analysisadvice complexitybin packingonline computationvector packing

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• scientific article; zbMATH DE number 6678949 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 566079 (Why is no real title available?)
• Beating the harmonic lower bound for online bin packing
• Bin packing can be solved within 1+epsilon in linear time
• Fast algorithms for bin packing
• New lower bounds for certain classes of bin packing algorithms
• On Multidimensional Packing Problems
• On the Advice Complexity of Online Problems
• Online algorithms with advice for bin packing and scheduling problems
• Online bin packing with advice
• Online bin packing with advice of small size
• Packing small vectors
• Resource constrained scheduling as generalized bin packing
• The optimal absolute ratio for online bin packing
• Tight bounds for online vector bin packing
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms

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)