Pages that link to "Item:Q4157950"
From MaRDI portal
The following pages link to On the complexity of computing the measure of ∪[a <sub>i</sub> ,b <sub>i</sub> ] (Q4157950):
Displaying 26 items.
- An improved algorithm for Klee's measure problem on fat boxes (Q419375) (← links)
- On the computational complexity of (maximum) shift class scheduling (Q684343) (← links)
- An O(n log n) Manhattan path algorithm (Q795510) (← links)
- An in-place algorithm for Klee's measure problem in two dimensions (Q845997) (← links)
- Efficient transformations for Klee's measure problem in the streaming model (Q904110) (← links)
- An optimum \(\Theta\) (n log n) algorithm for finding a canonical Hamiltonian path and a canonical Hamiltonian circuit in a set of intervals (Q915465) (← links)
- The inequality-satisfiability problem (Q935232) (← links)
- Approximating the volume of unions and intersections of high-dimensional geometric objects (Q982950) (← links)
- A (slightly) faster algorithm for Klee's measure problem (Q1037647) (← links)
- Finding Hamiltonian circuits in proper interval graphs (Q1050117) (← links)
- Lower bounds on probabilistic linear decision trees (Q1067786) (← links)
- Geometric complexity of some location problems (Q1099951) (← links)
- On the \(\Omega (n\log n)\) lower bound for convex hull and maximal vector determination (Q1140425) (← links)
- On the complexity of finding the convex hull of a set of points (Q1158971) (← links)
- Comparisons between linear functions can help (Q1170029) (← links)
- On the computational complexity of (maximum) class scheduling (Q1179005) (← links)
- Parallel computational geometry of rectangles (Q1187198) (← links)
- An optimal parallel algorithm for the domatic partition problem on an interval graph given its sorted model (Q1195857) (← links)
- License class design: Complexity and algorithms (Q1207538) (← links)
- Minimum node disjoint path covering for circular-arc graphs (Q1257337) (← links)
- Periodic assignment and graph colouring (Q1329789) (← links)
- Approximate map labeling is in \(\Omega (n\log n)\) (Q1338784) (← links)
- On optimal cuts of hyperrectangles (Q1900692) (← links)
- Computing the depth distribution of a set of boxes (Q2049979) (← links)
- Visibility maps of segments and triangles in 3D (Q2477193) (← links)
- Calculation of Discrepancy Measures and Applications (Q5264200) (← links)
