The union of probabilistic boxes: Maintaining the volume

DOI10.1007/978-3-642-23719-5_50MaRDI QIDQ3092263zbMATH OpenOpenAlexFDO

Authors Hakan Yildiz, Luca Foschini, John Hershberger, Subhash Suri

Publication date 16 September 2011

Published in Algorithms – ESA 2011 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-23719-5_50

Mathematics Subject Classification ID

Combinatorial probability (60C05) Data structures (68P05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Maximum box problem on stochastic points
• Maximum box problem on stochastic points
• A (slightly) faster algorithm for Klee's measure problem
• scientific article; zbMATH DE number 3967917
• Computing the volume of the union of cubes

Cited in

(5)

• Approximating the Expected Values for Combinatorial Optimization Problems over Stochastic Points
• Union of hypercubes and 3D Minkowski sums with random sizes
• Maximum box problem on stochastic points
• Conditional lower bounds for dynamic geometric measure problems
• Conditional lower bounds for dynamic geometric measure problems

This page was built for publication: The union of probabilistic boxes: Maintaining the volume

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