Best fit bin packing with random order revisited
From MaRDI portal
Publication:1979457
Recommendations
Cites work
- `` Strong NP-Completeness Results
- A 2/3-approximation algorithm for vertex weighted matching in bipartite graphs
- A logarithmic additive integrality gap for bin packing
- A new and improved algorithm for online bin packing
- A new lower bound for classic online bin packing
- A simple on-line bin-packing algorithm
- Anomalous behavior in bin packing algorithms
- Approximation and online algorithms for multidimensional bin packing: a survey
- Average-case analysis of the smart next fit algorithm
- Best fit bin packing with random order revisited
- Bin packing can be solved within 1+epsilon in linear time
- Bounds on Multiprocessing Timing Anomalies
- Fast algorithms for bin packing
- How to match when all vertices arrive online
- scientific article; zbMATH DE number 6678949 (Why is no real title available?)
- scientific article; zbMATH DE number 52589 (Why is no real title available?)
- scientific article; zbMATH DE number 3557207 (Why is no real title available?)
- scientific article; zbMATH DE number 871933 (Why is no real title available?)
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- On the absolute approximation ratio for first fit and related results
- On the online bin packing problem
- On-line bin packing in linear time
- Online bin covering: expectations vs. guarantees
- Online bipartite matching with random arrivals, an approach based on strongly factor-revealing LPs
- Online matching and ad allocation
- Online vertex-weighted bipartite matching. Beating \(1-\frac{1}{e}\) with random arrivals
- Optimal analysis of best fit bin packing
- Probabilistic analysis of online (class-constrained) bin packing and bin covering
- Probabilistic analysis of the dual next-fit algorithm for bin covering
- Random-order bin packing
- The average-case analysis of some on-line algorithms for bin packing
- Tight competitive ratios of classic matching algorithms in the fully online model
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
Cited in
(12)- Bin packing using semi-ordinal data
- Next-fit bin packing with random piece sizes
- scientific article; zbMATH DE number 871933 (Why is no real title available?)
- Best fit bin packing with random order revisited
- Online bin packing: old algorithms and new results
- Machine covering in the random-order model
- Knapsack secretary through boosting
- More on online cardinality constrained bin packing with small cardinality bounds
- Near-optimal algorithms for stochastic online bin packing
- Random-order online independent set of intervals and hyperrectangles
- Lower bounds for several standard bin packing algorithms in the random order model
- Random-order bin packing
This page was built for publication: Best fit bin packing with random order revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1979457)
