The Union of Probabilistic Boxes: Maintaining the Volume

DOI10.1007/978-3-642-23719-5_50zbMath1346.68076OpenAlexW1539720494MaRDI QIDQ3092263

Hakan Yildiz, Luca Foschini, J. E. 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) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)

Related Items (2)

Approximating the Expected Values for Combinatorial Optimization Problems over Stochastic Points ⋮ Maximum box problem on stochastic points

This page was built for publication: The Union of Probabilistic Boxes: Maintaining the Volume