Algorithms – ESA 2005

DOI10.1007/11561071zbMATH Open1162.90544OpenAlexW2501059503MaRDI QIDQ5475869

Leah Epstein

Publication date: 27 June 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11561071

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Combinatorial optimization (90C27)

Related Items (6)

Online bin packing with delay and holding costs ⋮ On the online bin packing problem ⋮ On-line bin packing ? A restricted survey ⋮ Selfish bin packing with cardinality constraints ⋮ The optimal absolute ratio for online bin packing ⋮ Online bin packing with arbitrary release times

Recommendations

• Algorithms for on-line bin-packing problems with cardinality constraints 👍 👎
• Online bin packing with cardinality constraints resolved 👍 👎
• Improved lower bounds for the online bin packing problem with cardinality constraints 👍 👎
• Bounds for online bin packing with cardinality constraints 👍 👎
• On the online bin packing problem 👍 👎
• On online bin packing with LIB constraints 👍 👎
• Online Bin Packing with Cardinality Constraints 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Algorithms – ESA 2005

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5475869)