Average case analysis of bounded space bin packing algorithms
From MaRDI portal
Publication:2471807
DOI10.1007/S00453-007-9073-YzbMATH Open1203.68310OpenAlexW2004367594MaRDI QIDQ2471807FDOQ2471807
Authors: Nir Naaman, Raphael Rom 
Publication date: 18 February 2008
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-007-9073-y
Recommendations
- Limiting fractal random processes in heavy-tailed systems
- A functional limit theorem for random processes with immigration in the case of heavy tails
- Correlated continuous time random walks
- Fractionally integrated inverse stable subordinators
- Large deviations for subordinated fractional Brownian motion and applications
Cites Work
- Title not available (Why is that?)
- A simple on-line bin-packing algorithm
- Fast algorithms for bin packing
- Bin packing with discrete item sizes, part II: Tight bounds on First Fit
- Markov chains, computer proofs, and average-case analysis of best fit bin packing
- Bounded space on-line bin packing: Best is better than first
- A stochastic analysis of the NFD bin-packing algorithm
- A probabilistic analysis of the next fit decreasing bin packing heuristic
- Best \(k\)-fit bin packing
- Title not available (Why is that?)
- Martingale Inequalities and NP-Complete Problems
- A stochastic model of bin-packing
- Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings
- On the sum-of-squares algorithm for bin packing
- Probabilistic analysis of the next fit decreasing algorithm for bin- packing
- Average-case analysis of the smart next fit algorithm
- Optimal Bin Packing with Items of Random Sizes II
- Necessary and sufficient conditions for stability of a bin-packing system
- Stochastic analysis of a slotted FIFO communication channel
Cited In (12)
- Average-case analyses of first fit and random fit bin packing
- Interior-point-based online stochastic bin packing
- Average-case analysis of the smart next fit algorithm
- Using Markov chains to design algorithms for bounded-space on-line bin cover
- Average-case competitive analyses for one-way trading
- Fractionally integrated inverse stable subordinators
- Average Case Analysis of Marking Algorithms
- Probabilistic Analysis of Online Bin Coloring Algorithms Via Stochastic Comparison
- Average-Case Competitive Analyses for One-Way Trading
- Theory and Applications of Models of Computation
- Title not available (Why is that?)
- Limiting fractal random processes in heavy-tailed systems
This page was built for publication: Average case analysis of bounded space bin packing algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2471807)
