scientific article; zbMATH DE number 5019895

Pankaj K. Agarwal, Sariel Har-Peled, Kasturi R. Varadarajan

Publication date: 28 April 2006

Full work available at URL: http://www.msri.org/communications/books/Book52/

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

clustering extent measures \(\varepsilon\)-kernels coset based algorithms

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Related Items (59)

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 ⋮ Dynamic coresets ⋮ An efficient sum query algorithm for distance-based locally dominating functions ⋮ Linear-Time Approximation Algorithms for Unit Disk Graphs ⋮ Unnamed Item ⋮ Effective Scenarios in Multistage Distributionally Robust Optimization with a Focus on Total Variation Distance ⋮ Communication costs in a geometric communication network ⋮ Unnamed Item ⋮ An efficient sum query algorithm for distance-based locally dominating functions ⋮ Minimal enclosing discs, circumcircles, and circumcenters in normed planes. I. ⋮ Minimal enclosing discs, circumcircles, and circumcenters in normed planes. II. ⋮ Polynomial approximate discretization of geometric centers in high-dimensional Euclidean space ⋮ Approximate Polytope Membership Queries ⋮ Simplified Planar Coresets for Data Streams ⋮ Network Essence: PageRank Completion and Centrality-Conforming Markov Chains ⋮ Shifting Coresets: Obtaining Linear-Time Approximations for Unit Disk Graphs and Other Geometric Intersection Graphs ⋮ Unnamed Item ⋮ An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions ⋮ Core-Sets: Updated Survey ⋮ Efficient subspace approximation algorithms ⋮ Coresets for the Nearest-Neighbor Rule ⋮ Approximate Convex Hull of Data Streams ⋮ Sublinear Algorithms for MAXCUT and Correlation Clustering ⋮ Window queries for intersecting objects, maximal points and approximations using coresets ⋮ On Geometric Prototype and Applications ⋮ High-dimensional approximate \(r\)-nets ⋮ Solving the Chromatic Cone Clustering Problem via Minimum Spanning Sphere ⋮ Analysis of incomplete data and an intrinsic-dimension Helly theorem ⋮ Minimal containment under homothetics: a simple cutting plane approach ⋮ Small space representations for metric min-sum \(k\)-clustering and their applications ⋮ An almost space-optimal streaming algorithm for coresets in fixed dimensions ⋮ Approximate range searching: The absolute model ⋮ Unnamed Item ⋮ Approximating Largest Convex Hulls for Imprecise Points ⋮ Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy ⋮ Learning big (image) data via coresets for dictionaries ⋮ Approximating largest convex hulls for imprecise points ⋮ Data Exploration by Representative Region Selection: Axioms and Convergence ⋮ Sparse Approximation via Generating Point Sets ⋮ Practical methods for shape fitting and kinetic data structures using coresets ⋮ On coresets for support vector machines ⋮ A dual simplex-type algorithm for the smallest enclosing ball of balls ⋮ Some Estimates on the Discretization of Geometric Center-Based Problems in High Dimensions ⋮ Fast subspace approximation via greedy least-squares ⋮ Robust shape fitting via peeling and grating coresets ⋮ Single facility collection depots location problem in the plane ⋮ Approximating Distance Measures for the Skyline ⋮ Aggregation error for location models: Survey and analysis ⋮ A faster algorithm for truth discovery via range cover ⋮ Approximate Range Queries for Clustering ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Streaming algorithms for extent problems in high dimensions ⋮ Complexity and approximation of the smallest \(k\)-enclosing ball problem ⋮ Approximation and complexity of the capacitated geometric median problem

This page was built for publication: