Summary
Letn random intervalsI 1, ...,I n be chosen by selecting endpoints independently from the uniform distribution on [0.1]. Apacking is a pairwise disjoint subset of the intervals; itswasted space is the Lebesgue measure of the points of [0,1] not covered by the packing. In any set of intervals the packing with least wasted space is computationally easy to find; but its expected wasted space in the random case is not obvious. We show that with high probability for largen, this “best” packing has wasted space\(O(\frac{{\log ^2 n}}{n})\). It turns out that if the endpoints 0 and 1 are identified, so that the problem is now one of packing random arcs in a unit-circumference circle, then optimal wasted space is reduced toO(1/n). Interestingly, there is a striking difference between thesizes of the best packings: about logn intervals in the unit interval case, but usually only one or two arcs in the circle case.
Article PDF
We’re sorry, something doesn't seem to be working properly.
Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.
References
Alon, N., Spencer, J.H.: The Probabilistic Method. Wiley & Sons, New York (1991).
Coffman, E.G., Jr., Mallows, C.L., Poonen, Bjorn. “Parking Arcs on the Circle with Applications to One-Dimensional Communication Networks.” Ann. Appl. Prob.,4 (4), in press (1994)
Justicz, J., Scheinerman, E.R., Winkler, P.M.: “Random Intervals.” Amer. Math. Monthly,97, 881–889 (1990).
Lipton, R.J., Tomkins, Andrew: “Online Interval Scheduling” Proc. 5th Ann. ACM-SIAM Symp. Disc. Alg., 302–311 (1994)
Long, D., Thakur, M.: “Scheduling Real-Time Disk Transfers for Continuous Media Applications.” 12th Ann. IEEE Symp. Mass Stor. Sys., 227–232 (1993)