scientific article; zbMATH DE number 1302378

zbMATH Open0936.68055MaRDI QIDQ4247679FDOQ4247679

Authors: Bogdan S. Chlebus 

Publication date: 16 June 1999

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

Klee's measure problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited In (11)

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

This page was built for publication:

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