Markov chains, computer proofs, and average-case analysis of best fit bin packing

Authors:
E. G. Coffman, Jr.;D. S. Johnson;P. W. Shor;R. R. Weber
Affiliations:
-;-;-;-
Venue:
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Year:
1993

Citing 7
Cited 11

The average-case analysis of some on-line algorithms for bin packing

Combinatorica
On random walks arising in queueing systems: ergodicity and transience via quadratic forms as Lyapunov functions—Part I

Proceedings of the workshop held at the Mathematical Sciences Institute Cornell University on Mathematical theory of queueing systems
Fundamental discrepancies between average-case analyses under discrete and continuous distributions: a bin packing case study

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Optimal prefetching via data compression (extended abstract)

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
How to pack better than best fit: tight bounds for average-case on-line bin packing

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
A Bin Packing Algorithm with Complexity O(n log n) and Performance 1 in the Stochastic Limit

Proceedings on Mathematical Foundations of Computer Science
Some unexpected expected behavior results for bin packing

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing

Biased random walks, Lyapunov functions, and stochastic analysis of best fit bin packing

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Best-fit bin-packing with random order

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Average-case analyses of first fit and random fit bin packing

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Beating the 2&Dgr; bound for approximately counting colourings: a computer-assisted proof of rapid mixing

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
On the sum-of-squares algorithm for bin packing

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
An extension of path coupling and its application to the Glauber dynamics for graph colourings (extended abstract)

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Linear waste of best fit bin packing on skewed distributions

Random Structures & Algorithms - Probabilistic methods in combinatorial optimization
A Self Organizing Bin Packing Heuristic

ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
On the Sum-of-Squares algorithm for bin packing

Journal of the ACM (JACM)
Probabilistic Analysis of Online Bin Coloring Algorithms Via Stochastic Comparison

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Bounded-space online bin cover

Journal of Scheduling

Quantified Score

Hi-index	0.00

Markov chains, computer proofs, and average-case analysis of best fit bin packing

Quantified Score

Visualization

Abstract