Geometric approximation algorithms
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Local spanners revisited
- Intrinsic dimension adaptive partitioning for kernel methods
- KNOWLEDGE-BASED METHODS FOR OPTIMUM APPROXIMATION OF GEOMETRIC DILUTION OF PRECISION
- A quadtree, a Steiner spanner, and approximate nearest neighbours in hyperbolic space
- Approximating multiplicatively weighted Voronoi diagrams: efficient construction with linear size
- Near optimal locality sensitive orderings in Euclidean space
- Fully dynamic maximum independent sets of disks in polylogarithmic update time
- Eight-partitioning points in 3D, and efficiently too
- Data structures for approximate Fréchet distance for realistic curves
- Jaywalking your dog: computing the Fréchet distance with shortcuts
- Computing data distribution from query selectivities
- On the discrete and semi-continuous versions of the two-watchtower problem in the plane
- Approximating length-restricted means under dynamic time warping
- Near-linear algorithms for geometric hitting sets and set covers
- Light Euclidean Spanners with Steiner Points
- Approximation algorithms for low-distortion embeddings into low-dimensional spaces
- Improved dynamic geodesic nearest neighbor searching in a simple polygon
- How packed is it, really?
- Dimension-independent kernel -covers
- An algorithmic framework for the single source shortest path problem with applications to disk graphs
- A probabilistic approach to reducing algebraic complexity of Delaunay triangulations
- Density-based clustering in MapReduce with guarantees on parallel time, space, and solution quality
- Robust proximity search for balls using sublinear space
- Spanners for directed transmission graphs
- scientific article; zbMATH DE number 1571500 (Why is no real title available?)
- Bounds on the cost of compatible refinement of simplex decomposition trees in arbitrary dimensions
- Approximation algorithms for color spanning diameter
- On Locality-Sensitive Orderings and Their Applications
- scientific article; zbMATH DE number 7164768 (Why is no real title available?)
- Approximate range closest-pair queries
- Preprocessing Ambiguous Imprecise Points
- Erdős-Hajnal conjecture for graphs with bounded VC-dimension
- On the complexity of randomly weighted multiplicative Voronoi diagrams
- Approximating the maximum overlap of polygons under translation
- scientific article; zbMATH DE number 2081090 (Why is no real title available?)
- Assignment flows
- The complexity of computing a bisimilarity pseudometric on probabilistic automata
- scientific article; zbMATH DE number 1130743 (Why is no real title available?)
- Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location
- Influence-based Voronoi diagrams of clusters
- On separating points by lines
- A faster algorithm for truth discovery via range cover
- scientific article; zbMATH DE number 7559245 (Why is no real title available?)
- Adaptive deep Fourier residual method via overlapping domain decomposition
- scientific article; zbMATH DE number 7559228 (Why is no real title available?)
- Sparse higher order Čech filtrations
- Routing on heavy-path WSPD-spanners
- Sublinear geometric algorithms
- Faster algorithms for growing prioritized disks and rectangles
- Near-optimal algorithms for the assortment planning problem under dynamic substitution and stochastic demand
- Approximating Distance Measures for the Skyline
- Parallel line centers with guaranteed separation
- Output sensitive algorithms for approximate incidences and their applications
- \((\delta ,\varepsilon)\)-ball approximation of a shape: definition and complexity
- Fast local searches and updates in bounded universes
- Online spanners in metric spaces
- Geometric Packing under Nonuniform Constraints
- Optimal approximations made easy
- Computing instance-optimal kernels in two dimensions
- scientific article; zbMATH DE number 7561387 (Why is no real title available?)
- Dynamic connectivity in disk graphs
- scientific article; zbMATH DE number 5019895 (Why is no real title available?)
- Adaptive atlas of connectivity maps
- Approximation algorithm for minimum partial multi-cover under a geometric setting
- Sparse convex hull coverage
- Streaming algorithms for geometric Steiner forest
- Scaling by subsampling for big data, with applications to statistical learning
- scientific article; zbMATH DE number 7205030 (Why is no real title available?)
- scientific article; zbMATH DE number 7204982 (Why is no real title available?)
- The VC dimension of metric balls under Fréchet and Hausdorff distances
- Polynomial-sized topological approximations using the permutahedron
- Sampling in combinatorial and geometric set systems
- Window queries for intersecting objects, maximal points and approximations using coresets
- Minimum weight Euclidean (1+)-spanners
- Approximate polytope membership queries
- Approximating nearest neighbor distances
- Near-linear time approximation schemes for geometric maximum coverage
- Coresets for \((k, \ell ) \)-median clustering under the Fréchet distance
- Approximating the -low-density value
- Disjointness through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond
- Two proofs for shallow packings
- A geometric buildup algorithm for the solution of the distance geometry problem using least-squares approximation
- Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications
- Metric spaces with expensive distances
- Static and streaming data structures for Fréchet distance queries
- On multiplicative \(\lambda\)-approximations and some geometric applications
- scientific article; zbMATH DE number 7559205 (Why is no real title available?)
- Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications
- Online Euclidean spanners
- Routing on heavy path WSPD spanners
- Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points
- Embeddings and near-neighbor searching with constant additive error for hyperbolic spaces
- Nearest-neighbor searching under uncertainty. I
- Approximating the smallest \(k\)-enclosing geodesic disc in a simple polygon
- Space exploration via proximity search
- Optimal algorithms for geometric centers and depth
- Unsupervised assignment flow: label learning on feature manifolds by spatially regularized geometric assignment
- Improved bounds for the expected number of k-sets
- Quasi-uniform designs with optimal and near-optimal uniformity constant
- On undecided LP, clustering and active learning
This page was built for publication: Geometric approximation algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3010463)
