Packing random intervals

DOI10.1007/BF01295224MaRDI QIDQ5917633zbMATH OpenOpenAlexFDO

Authors E. G. jun. Coffman, Bjorn Poonen, Peter Winkler

Publication date 15 August 1995

Published in Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01295224

zbMATH Keywords

uniform distributionpackingwasted spacepacking random arcspacking with least wasted space

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Random convex sets and integral geometry (aspects of convex geometry) (52A22) Combinatorial aspects of packing and covering (05B40)

Recommendations

• Packing random intervals
• The random weighted interval packing problem: The intermediate density case.
• Tight bound of random interval packing
• Random Covering and Packing on the Line
• Packing rectangles and intervals^∗

Cites work

• scientific article; zbMATH DE number 1003261 (Why is no real title available?)
• Parking arcs on the circle with applications to one-dimensional communication networks
• Random Intervals
• The probabilistic method

Cited in

(11)

• Random Intervals
• Packing random intervals
• Order of decay of the wasted space for a stochastic packing problem.
• Packing items from a triangular distribution
• Tail Bounds and Expectations for Random Arc Allocation and Applications
• A note on packing random intervals with varying density
• The Temp Secretary Problem
• Expected wasted space of optimal simple rectangle packing
• The random weighted interval packing problem: The intermediate density case.
• Tight bound of random interval packing
• Packing rectangles and intervals^∗

This page was built for publication: Packing random intervals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5917633)