Average-case analysis of the modified harmonic algorithm
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3890754 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- A simple on-line bin-packing algorithm
- A stochastic model of bin-packing
- Fast probabilistic algorithms for Hamiltonian circuits and matchings
- On-line bin packing in linear time
- Probabilistic analysis for simple one- and two-dimensional bin packing algorithms
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
Cited in
(6)- Randomized algorithms for the on-line minimum matching problem on euclidean space
- Average-case analysis of the smart next fit algorithm
- The average-case analysis of some on-line algorithms for bin packing
- scientific article; zbMATH DE number 894864 (Why is no real title available?)
- Average-case analysis of the double description method and the beneath-beyond algorithm
- Packings in two dimensions: Asymptotic average-case analysis of algorithms
This page was built for publication: Average-case analysis of the modified harmonic algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1825655)