Packing Random Intervals On-Line
✍ Scribed by E. G. Coffman, Jr.; L. Flatto; P. Jelenković; B. Poonen
- Publisher
- Springer
- Year
- 1998
- Tongue
- English
- Weight
- 279 KB
- Volume
- 22
- Category
- Article
- ISSN
- 0178-4617
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
It is known that given N random subintervals of [0, 1], one can find a disjoint subcollection that covers all of [0, 1] except a set of length about (log N)2/N. We investigate what happens when the distribution of the intervals is biased to favor shorter intervals or intervals close to the endpoints
In this problem, we are given N uniformly distributed random intervals of 0 1 . For each random interval I, we are given a weight X I . These weights are independent, independent of the intervals, and satisfy P X I ≤ t = t α , where α > 0. A packing of the family is a disjoint subfamily of intervals