On the complexity of computing the measure of ∪[a i ,b i ]

Cited in

(27)

On the computational complexity of (maximum) shift class scheduling
Parallel computational geometry of rectangles
Lower bounds on probabilistic linear decision trees
Geometric complexity of some location problems
An improved algorithm for Klee's measure problem on fat boxes
An in-place algorithm for Klee's measure problem in two dimensions
Finding Hamiltonian circuits in proper interval graphs
Periodic assignment and graph colouring
A (slightly) faster algorithm for Klee's measure problem
On the complexity of finding the convex hull of a set of points
Minimum node disjoint path covering for circular-arc graphs
On the (n n) lower bound for convex hull and maximal vector determination
Approximate map labeling is in (n n)
Comparisons between linear functions can help
Computing the depth distribution of a set of boxes
Approximating the volume of unions and intersections of high-dimensional geometric objects
Efficient transformations for Klee's measure problem in the streaming model
Visibility maps of segments and triangles in 3D
An optimum \(\Theta\) (n log n) algorithm for finding a canonical Hamiltonian path and a canonical Hamiltonian circuit in a set of intervals
On the computational complexity of (maximum) class scheduling
Calculation of discrepancy measures and applications
License class design: Complexity and algorithms
An optimal parallel algorithm for the domatic partition problem on an interval graph given its sorted model
An O(n log n) Manhattan path algorithm
On optimal cuts of hyperrectangles
Klee's measure problem made oblivious
The inequality-satisfiability problem

This page was built for publication: On the complexity of computing the measure of ∪[a _i ,b _i ]

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