Geometric approximation algorithms
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- 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
- Stabbing convex bodies with lines and flats
- Computing the rectilinear center of uncertain points in the plane
- Dynamic smooth compressed quadtrees
- Conic nearest neighbor queries and approximate Voronoi diagrams
- A nearly quadratic bound for point-location in hyperplane arrangements, in the linear decision tree model
- Online geometric hitting set using points in \(\mathbb{Z}^d\)
- An output-sensitive algorithm for computing the union of cubes and fat boxes in 3D
- Dynamic enumeration of similarity joins
- Optimal volume-sensitive bounds for polytope approximation
- The geodesic edge center of a simple polygon
- Testing proximity to subspaces: approximate \(\ell_\infty\) minimization in constant time
- A note on stabbing convex bodies with points, lines, and flats
- From proximity to utility: a Voronoi partition of Pareto optima
- General techniques for combinatorial approximation
- Partition of unity methods for signal processing on graphs
- Online Spanners in Metric Spaces
- scientific article; zbMATH DE number 7278008 (Why is no real title available?)
- Minimum weight Euclidean \((1+\varepsilon)\)-spanners
- Self-assignment flows for unsupervised data labeling on graphs
- Approximating maximum diameter-bounded subgraph in unit disk graphs
- Sparse Approximation via Generating Point Sets
- Journey to the Center of the Point Set
- On locality-sensitive orderings and their applications
- Random-order online independent set of intervals and hyperrectangles
- Approximating maximum diameter-bounded subgraph in unit disk graphs
- A size-sensitive discrepancy bound for set systems of bounded primal shatter dimension
- Subset selection for multiple linear regression via optimization
- Approximate range queries for clustering
- A gap-ETH-tight approximation scheme for Euclidean TSP
- Approximating Minimization Diagrams and Generalized Proximity Search
- On the combinatorial complexity of approximating polytopes
- scientific article; zbMATH DE number 7692724 (Why is no real title available?)
- Clustering with faulty centers
- Making the computation of approximations of invariant measures and its attractors for IFS and GIFS, through the deterministic algorithm, tractable
- Minimum perimeter-sum partitions in the plane
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)
