Geometric approximation algorithms
From MaRDI portal
Publication:3010463
Recommendations
Cited in
(only showing first 100 items - show all)- The VC dimension of metric balls under Fréchet and Hausdorff distances
- The complexity of computing a bisimilarity pseudometric on probabilistic automata
- Approximate polytope membership queries
- Computing the rectilinear center of uncertain points in the plane
- Window queries for intersecting objects, maximal points and approximations using coresets
- Dynamic smooth compressed quadtrees
- On locality-sensitive orderings and their applications
- \((\delta ,\varepsilon)\)-ball approximation of a shape: definition and complexity
- Nearest-neighbor searching under uncertainty. I
- Output sensitive algorithms for approximate incidences and their applications
- Near-optimal algorithms for the assortment planning problem under dynamic substitution and stochastic demand
- Approximation algorithm for minimum partial multi-cover under a geometric setting
- Routing on heavy-path WSPD-spanners
- Preprocessing Ambiguous Imprecise Points
- Polynomial-sized topological approximations using the permutahedron
- On the complexity of randomly weighted multiplicative Voronoi diagrams
- Subset selection for multiple linear regression via optimization
- scientific article; zbMATH DE number 1130743 (Why is no real title available?)
- scientific article; zbMATH DE number 7205030 (Why is no real title available?)
- Disjointness through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond
- On multiplicative \(\lambda\)-approximations and some geometric applications
- A probabilistic approach to reducing algebraic complexity of Delaunay triangulations
- Assignment flows
- Improved bounds for the expected number of \(k\)-sets
- Near-linear time approximation schemes for geometric maximum coverage
- Approximate range closest-pair queries
- Near-linear algorithms for geometric hitting sets and set covers
- Influence-based Voronoi diagrams of clusters
- On separating points by lines
- Self-assignment flows for unsupervised data labeling on graphs
- Sparse convex hull coverage
- On the combinatorial complexity of approximating polytopes
- Fast local searches and updates in bounded universes
- Approximation algorithms for low-distortion embeddings into low-dimensional spaces
- Improved dynamic geodesic nearest neighbor searching in a simple polygon
- scientific article; zbMATH DE number 7561387 (Why is no real title available?)
- Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications
- An algorithmic framework for the single source shortest path problem with applications to disk graphs
- Bounds on the cost of compatible refinement of simplex decomposition trees in arbitrary dimensions
- Two proofs for shallow packings
- Approximating length-restricted means under dynamic time warping
- Metric spaces with expensive distances
- Optimal approximations made easy
- A geometric buildup algorithm for the solution of the distance geometry problem using least-squares approximation
- scientific article; zbMATH DE number 7559205 (Why is no real title available?)
- On Locality-Sensitive Orderings and Their Applications
- Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications
- Approximation algorithms for color spanning diameter
- Sampling in combinatorial and geometric set systems
- Sparse Approximation via Generating Point Sets
- Space exploration via proximity search
- scientific article; zbMATH DE number 7164768 (Why is no real title available?)
- scientific article; zbMATH DE number 5019895 (Why is no real title available?)
- A nearly quadratic bound for point-location in hyperplane arrangements, in the linear decision tree model
- Conic nearest neighbor queries and approximate Voronoi diagrams
- Journey to the Center of the Point Set
- Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points
- Testing proximity to subspaces: approximate \(\ell_\infty\) minimization in constant time
- From proximity to utility: a Voronoi partition of Pareto optima
- Approximating the maximum overlap of polygons under translation
- Spanners for directed transmission graphs
- Jaywalking your dog: computing the Fréchet distance with shortcuts
- Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location
- Sublinear geometric algorithms
- scientific article; zbMATH DE number 7559245 (Why is no real title available?)
- Unsupervised assignment flow: label learning on feature manifolds by spatially regularized geometric assignment
- Erdős-Hajnal conjecture for graphs with bounded VC-dimension
- Robust proximity search for balls using sublinear space
- Approximating nearest neighbor distances
- Geometric Packing under Nonuniform Constraints
- Partition of unity methods for signal processing on graphs
- Approximating Minimization Diagrams and Generalized Proximity Search
- scientific article; zbMATH DE number 1571500 (Why is no real title available?)
- A size-sensitive discrepancy bound for set systems of bounded primal shatter dimension
- Approximating maximum diameter-bounded subgraph in unit disk graphs
- Approximating the \(\lambda \)-low-density value
- Approximating maximum diameter-bounded subgraph in unit disk graphs
- Minimum weight Euclidean \((1+\varepsilon)\)-spanners
- Scaling by subsampling for big data, with applications to statistical learning
- scientific article; zbMATH DE number 7278008 (Why is no real title available?)
- Adaptive deep Fourier residual method via overlapping domain decomposition
- scientific article; zbMATH DE number 2081090 (Why is no real title available?)
- Adaptive atlas of connectivity maps
- Faster algorithms for growing prioritized disks and rectangles
- Quasi-uniform designs with optimal and near-optimal uniformity constant
- Clustering with faulty centers
- Routing on heavy path WSPD spanners
- A faster algorithm for truth discovery via range cover
- Dynamic connectivity in disk graphs
- KNOWLEDGE-BASED METHODS FOR OPTIMUM APPROXIMATION OF GEOMETRIC DILUTION OF PRECISION
- General techniques for combinatorial approximation
- Approximating the smallest \(k\)-enclosing geodesic disc in a simple polygon
- scientific article; zbMATH DE number 7204982 (Why is no real title available?)
- A note on stabbing convex bodies with points, lines, and flats
- Coresets for \((k, \ell ) \)-median clustering under the Fréchet distance
- Making the computation of approximations of invariant measures and its attractors for IFS and GIFS, through the deterministic algorithm, tractable
- Online Spanners in Metric Spaces
- Minimum weight Euclidean \((1+\varepsilon)\)-spanners
- scientific article; zbMATH DE number 7692724 (Why is no real title available?)
- Intrinsic dimension adaptive partitioning for kernel methods
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)
