Pages that link to "Item:Q3631896"
From MaRDI portal
The following pages link to On Approximating the Depth and Related Problems (Q3631896):
Displaying 34 items.
- The maximum box problem for moving points in the plane (Q411213) (← links)
- Hardness of discrepancy computation and \(\varepsilon\)-net verification in high dimension (Q413466) (← links)
- Minimizing the error of linear separators on linearly inseparable data (Q427883) (← links)
- Approximating the Fréchet distance for realistic curves in near linear time (Q443909) (← links)
- Union of random Minkowski sums and network vulnerability analysis (Q471144) (← links)
- Lower bounds for the number of hyperplanes separating two finite sets of points (Q492284) (← links)
- Limits of local search: quality and efficiency (Q527441) (← links)
- Algorithms for marketing-mix optimization (Q547308) (← links)
- Range minima queries with respect to a random permutation, and approximate range counting (Q629829) (← links)
- Relative \((p,\varepsilon )\)-approximations in geometry (Q633202) (← links)
- The overlay of minimization diagrams in a randomized incremental construction (Q633216) (← links)
- Preprocessing imprecise points for Delaunay triangulation: simplified and extended (Q644800) (← links)
- A greedy clustering algorithm based on interval pattern concepts and the problem of optimal box positioning (Q670431) (← links)
- Discrete Voronoi games and \(\epsilon\)-nets, in two and three dimensions (Q679740) (← links)
- Covering many or few points with unit disks (Q839638) (← links)
- Geometric pattern matching for point sets in the plane under similarity transformations (Q989531) (← links)
- Enclosing weighted points with an almost-unit ball (Q990963) (← links)
- The discrete Voronoi game in \(\mathbb{R}^2\) (Q1616243) (← links)
- Building an optimal point-location structure in \(O(\operatorname{sort}(n))\) I/Os (Q1741853) (← links)
- Near-linear time approximation schemes for geometric maximum coverage (Q1748995) (← links)
- New exact algorithms for planar maximum covering location by ellipses problems (Q2029953) (← links)
- Robust fitting in computer vision: easy or hard? (Q2193856) (← links)
- An efficient sum query algorithm for distance-based locally dominating functions (Q2196604) (← links)
- Near-linear algorithms for geometric hitting sets and set covers (Q2291457) (← links)
- Near-linear approximation algorithms for geometric hitting sets (Q2429345) (← links)
- Solving some vector subset problems by Voronoi diagrams (Q2959192) (← links)
- Polynomial Time Algorithms for Bichromatic Problems (Q2971630) (← links)
- Delaunay Triangulation of Imprecise Points Simplified and Extended (Q3183447) (← links)
- Linear Time Approximation Schemes for Geometric Maximum Coverage (Q3196415) (← links)
- Matching Triangles and Basing Hardness on an Extremely Popular Conjecture (Q4571929) (← links)
- Simplex Range Searching and Its Variants: A Review (Q4604367) (← links)
- (Q4993304) (← links)
- An efficient sum query algorithm for distance-based locally dominating functions (Q5136267) (← links)
- A Size-Sensitive Discrepancy Bound for Set Systems of Bounded Primal Shatter Dimension (Q5743609) (← links)