Claire Kenyon, Yuval Rabani, Alistair Sinclair  Home/Search
Context
Related
| lix.polytechnique.fr/~keny...soda.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: lix.polytechnique.fr/~kenyon/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We study the average case performance of the Best Fit algorithm for on-line bin packing under the distribution Ufj; kg, in which the item sizes are uniformly distributed in the discrete range f1=k; 2=k; : : :; j=kg. Our main result is that, in the case j = k \Gamma 2, the expected waste for an infinite stream of items remains bounded. This settles an open problem posed recently by Coffman et al [4]. It is also the first result which involves a detailed analysis of the infinite... (Update)
Active bibliography (related documents): More All
0.8: Biased Random Walks, Lyapunov Functions, and Stochastic.. - Kenyon, Rabani, Sinclair (Correct)
0.2: On the discrete Bak-Sneppen model of self-organized criticality - Barbay, Kenyon (2000) (Correct)
0.2: Probability around the Quantum Gravity. - Part 1: Planar Pure.. - Malyshev (1998) (Correct)
Similar documents based on text: More All
0.4: Local Divergence of Markov Chains and the Analysis of.. - Rabani, Sinclair, Wanka (1998) (Correct)
0.2: Approximating the Number of Monomer-Dimer Coverings of a.. - Kenyon, Randall, Sinclair (1996) (Correct)
0.2: Algorithms Seminar, 1995-1996 - Salvy (1996) (Correct)
BibTeX entry: (Update)
@misc{ kenyon-biased,
author = "Claire Kenyon and Yuval Rabani and Alistair Sinclair",
title = "Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best
Fit Bin Packing",
url = "citeseer.ist.psu.edu/610756.html" }
Citations (may not include all citations):1749 An Introduction to Probability Theory and its Applications (context) - Feller - 1968
80 Worst case performance bounds for simple one-dimensional pac.. (context) - Johnson, Demers et al. - 1974
69 Average case analysis of greedy routing algorithms on arrays (context) - Leighton - 1990
68 Approximation algorithms for bin packing: A survey (context) - Jr, Garey et al. - 1996
29 Hitting-time and occupation-time bounds implied by drift ana.. (context) - Hajek - 1982
26 The average case analysis of some on-line algorithms for bin.. (context) - Shor - 1986
18 Fundamental discrepancies between average-case analyses unde.. (context) - Jr, Courcoubetis et al. - 1991
17 continuity and analyticity of countable Markov chains (context) - Malyshev, Menshikov - 1979
14 An introduction to queuing networks (context) - Walrand - 1988
10 On stochastic matrices associated with certain queueing proc.. (context) - Foster - 1953
9 Biased random walks - Azar, Broder et al. - 1992
8 computer proofs and average-case analysis of Best Fit bin pa.. (context) - Jr, Johnson et al. - 1993
4 Constructive Theory of Countable Markov Chains (context) - Fayolle, Malyshev et al. - 1992
Documents on the same site (http://www.lix.polytechnique.fr/~kenyon/): More
Sensitivity, Block Sensitivity, and l-Block Sensitivity of.. - Kenyon, Kutin (Correct)
Best-Fit Bin-Packing with Random Order - Kenyon (1997) (Correct)
Approximation Schemes for Metric Minimum Bisection and.. - Vega, Karpinski, Kenyon (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC