On the Klee's measure problem in small dimensions

DOI10.1007/3-540-49477-4_22MaRDI QIDQ4247679zbMATH OpenFDO

Authors Bogdan S. Chlebus

Publication date 16 June 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-49477-4_22

zbMATH Keywords

Klee's measure problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• A (slightly) faster algorithm for Klee's measure problem
• Klee's measure problem on fat boxes in time \(\partial(n^{(d+2)/3})\)
• New Upper Bounds in Klee’s Measure Problem

Cited in

(13)

• A (slightly) faster algorithm for Klee's measure problem
• Accelerated Monte Carlo estimation of exceedance probabilities under monotonicity constraints
• Computing Klee's measure of grounded boxes
• On Klee's measure problem for grounded boxes
• New Upper Bounds in Klee’s Measure Problem
• An improved algorithm for Klee's measure problem on fat boxes
• Klee's measure problem on fat boxes in time \(\partial(n^{(d+2)/3})\)
• An improved algorithm for computing the volume of the union of cubes
• A fast implementation for the 2D/3D box placement problem
• Combinatorial designs meet hypercliques: higher lower bounds for Klee's measure problem and related problems in dimensions d 4
• Improved streaming algorithm for the Klee's measure problem and generalizations
• An in-place algorithm for Klee's measure problem in two dimensions
• Efficient transformations for Klee's measure problem in the streaming model

This page was built for publication: On the Klee's measure problem in small dimensions

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