scientific article; zbMATH DE number 1756012
From MaRDI portal
Publication:4535798
zbMATH Open0987.68039MaRDI QIDQ4535798FDOQ4535798
Authors: Steven S. Seiden 
Publication date: 25 June 2002
Title of this publication is not available (Why is that?)
Recommendations
Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Combinatorial optimization (90C27) Nonnumerical algorithms (68W05)
Cited In (23)
- Algorithms – ESA 2005
- Title not available (Why is that?)
- Beating the harmonic lower bound for online bin packing
- Online algorithms with advice for bin packing and scheduling problems
- A new and improved algorithm for online bin packing
- On-line bin packing in linear time
- The optimal absolute ratio for online bin packing
- Online algorithms with advice for the dual bin packing problem
- The variable-width strip packing problem
- Online variable-sized bin packing
- On-line bin packing ? A restricted survey
- Online algorithms for a dual version of bin packing
- On online algorithms for bin, strip, and box packing, and their worst-case and average-case analysis
- Online bin packing with cardinality constraints resolved
- An asymptotic competitive scheme for online bin packing
- Online bin packing with arbitrary release times
- Algorithms for on-line bin-packing problems with cardinality constraints
- Online bin packing with delay and holding costs
- On the online bin packing problem
- Comparing online algorithms for bin packing problems
- Online Bin Packing with (1,1) and (2,R) Bins
- Title not available (Why is that?)
- All-Around Near-Optimal Solutions for the Online Bin Packing Problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4535798)
