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