Pages that link to "Item:Q1100912"
From MaRDI portal
The following pages link to The average-case analysis of some on-line algorithms for bin packing (Q1100912):
Displaying 41 items.
- Average-case analysis of cutting and packing in two dimensions (Q582210) (← links)
- Average-case competitive analyses for one-way trading (Q626450) (← links)
- Quantum information processing: The case of vanishing interaction energy (Q699172) (← links)
- A provably efficient algorithm for dynamic storage allocation (Q756873) (← links)
- How modeling can attract experimentalists to improve solar cell's efficiency: Divide-and-conquer approach (Q1021711) (← links)
- An O(n) bin-packing algorithm for uniformly distributed data (Q1065544) (← links)
- Average-case analysis of the smart next fit algorithm (Q1120280) (← links)
- Expected performance of the shelf heuristic for 2-dimensional packing (Q1121176) (← links)
- Does randomization help in on-line bin packing? (Q1198004) (← links)
- Packings in two dimensions: Asymptotic average-case analysis of algorithms (Q1209735) (← links)
- Tight bounds for minimax grid matching with applications to the average case analysis of algorithms (Q1262767) (← links)
- Multidimensional on-line bin-packing: An algorithm and its average-case analysis (Q1313752) (← links)
- Asymptotics for transportation cost in high dimensions (Q1345081) (← links)
- Average performance of greedy heuristics for the integer knapsack problem. (Q1420409) (← links)
- Average-case performance analysis of a 2D strip packing algorithm -- NFDH (Q1774522) (← links)
- Stochastic on-line knapsack problems (Q1804369) (← links)
- Performance analysis and improvement for some linear on-line bin-packing algorithms (Q1810864) (← links)
- Average-case analysis of the modified harmonic algorithm (Q1825655) (← links)
- A tight lower bound for optimal bin packing (Q1919179) (← links)
- Best fit bin packing with random order revisited (Q1979457) (← links)
- Filling random cycles (Q2055245) (← links)
- On online algorithms for bin, strip, and box packing, and their worst-case and average-case analysis (Q2217210) (← links)
- Gravitational allocation for uniform points on the sphere (Q2227716) (← links)
- A concentration inequality for the facility location problem (Q2670506) (← links)
- Perfect packing theorems and the average-case behavior of optimal and online bin packing (Q2780629) (← links)
- Probabilistische analyse von heuristiken der kombinatorischen optimierung – ein überbllck (Q3200892) (← links)
- Exact Bounds for the Stochastic Upward Matching Problem (Q3806444) (← links)
- Exact Bounds for the Stochastic Upward Matching Problem (Q3808933) (← links)
- Optimal Matching and Empirical Measures (Q4206152) (← links)
- Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing (Q4216135) (← links)
- Average-Case Analysis of Off-Line and On-Line Knapsack Problems (Q4225866) (← links)
- (Q4250194) (← links)
- Average-case analyses of first fit and random fit bin packing (Q4487093) (← links)
- Linear waste of best fit bin packing on skewed distributions (Q4537630) (← links)
- Randomized algorithms for the on-line minimum matching problem on euclidean space (Q4876378) (← links)
- (Q5089171) (← links)
- Interior-Point-Based Online Stochastic Bin Packing (Q5144776) (← links)
- Analysis of Stochastic Online Bin Packing Processes (Q5462796) (← links)
- Bin Packing with Queues (Q5504150) (← links)
- Adaptive Bin Packing with Overflow (Q5870378) (← links)
- Bounded space on-line bin packing: Best is better than first (Q5946401) (← links)