scientific article; zbMATH DE number 5019895
From MaRDI portal
Publication:5290249
zbMATH Open1123.68141MaRDI QIDQ5290249FDOQ5290249
Authors: Pankaj K. Agarwal, Sariel Har-Peled, Kasturi Varadarajan 
Publication date: 28 April 2006
Full work available at URL: http://www.msri.org/communications/books/Book52/
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 2081015
- Geometric approximation algorithms
- Coresets for polytope distance
- Approximation algorithms for a geometric set cover problem
- Near-linear approximation algorithms for geometric hitting sets
- Near-linear approximation algorithms for geometric hitting sets
- On the approximate computation of the geometric difference of sets
- Approximate minimum enclosing balls in high dimensions using core-sets
- Approximations and optimal geometric divide-and-conquer
- Approximation of convex sets by polytopes
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Computational aspects related to convexity (52B55)
Cited In (60)
- Optimal experimental design: formulations and computations
- Title not available (Why is that?)
- An efficient sum query algorithm for distance-based locally dominating functions
- A faster algorithm for truth discovery via range cover
- High-dimensional approximate \(r\)-nets
- Effective scenarios in multistage distributionally robust optimization with a focus on total variation distance
- Minimal containment under homothetics: a simple cutting plane approach
- Approximating Distance Measures for the Skyline
- Dynamic coresets
- Approximating Largest Convex Hulls for Imprecise Points
- Analysis of incomplete data and an intrinsic-dimension Helly theorem
- Practical methods for shape fitting and kinetic data structures using coresets
- Small space representations for metric min-sum \(k\)-clustering and their applications
- An almost space-optimal streaming algorithm for coresets in fixed dimensions
- Title not available (Why is that?)
- Approximation and complexity of the capacitated geometric median problem
- Minimal enclosing discs, circumcircles, and circumcenters in normed planes. I.
- Minimal enclosing discs, circumcircles, and circumcenters in normed planes. II.
- Robust shape fitting via peeling and grating coresets
- Lower bounds for number-in-hand multiparty communication complexity, made easy
- Solving the chromatic cone clustering problem via minimum spanning sphere
- Communication costs in a geometric communication network
- Approximate polytope membership queries
- Window queries for intersecting objects, maximal points and approximations using coresets
- A strong coreset algorithm to accelerate OPF as a graph-based machine learning in large-scale problems
- Linear-size universal discretization of geometric center-based problems in fixed dimensions
- Complexity and approximation of the smallest \(k\)-enclosing ball problem
- Network essence: PageRank completion and centrality-conforming Markov chains
- Single facility collection depots location problem in the plane
- Polynomial approximate discretization of geometric centers in high-dimensional Euclidean space
- Approximate convex intersection detection with applications to width and Minkowski sums
- Polytope approximation and the Mahler volume
- Training Gaussian mixture models at scale via coresets
- Simplified Planar Coresets for Data Streams
- Data exploration by representative region selection: axioms and convergence
- A dual simplex-type algorithm for the smallest enclosing ball of balls
- Title not available (Why is that?)
- Shifting coresets: obtaining linear-time approximations for unit disk graphs and other geometric intersection graphs
- Lower bounds for number-in-hand multiparty communication complexity, made easy
- Approximate range searching: The absolute model
- Sparse Approximation via Generating Point Sets
- Approximate range queries for clustering
- Aggregation error for location models: Survey and analysis
- An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions
- Learning big (image) data via coresets for dictionaries
- Some Estimates on the Discretization of Geometric Center-Based Problems in High Dimensions
- Automated scalable Bayesian inference via Hilbert coresets
- Approximating largest convex hulls for imprecise points
- Fast subspace approximation via greedy least-squares
- Coresets for the Nearest-Neighbor Rule
- On coresets for support vector machines
- Approximate convex hull of data streams
- On geometric prototype and applications
- Linear-time approximation algorithms for unit disk graphs
- Streaming algorithms for extent problems in high dimensions
- An efficient sum query algorithm for distance-based locally dominating functions
- Efficient subspace approximation algorithms
- Title not available (Why is that?)
- Core-sets: updated survey
- Sublinear algorithms for MAXCUT and correlation clustering
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5290249)
