Exact and approximation algorithms for clustering
From MaRDI portal
Publication:1601015
DOI10.1007/s00453-001-0110-yzbMath0994.68178OpenAlexW3137423196MaRDI QIDQ1601015
Pankaj K. Agarwal, Cecilia M. Procopiuc
Publication date: 17 June 2002
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-001-0110-y
Related Items (41)
Linear-size universal discretization of geometric center-based problems in fixed dimensions ⋮ Fixed Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs ⋮ Covering many or few points with unit disks ⋮ Preclustering algorithms for imprecise points ⋮ ON THE DISCRETE UNIT DISK COVER PROBLEM ⋮ AN ALGORITHMIC FRAMEWORK FOR SOLVING GEOMETRIC COVERING PROBLEMS — WITH APPLICATIONS ⋮ An efficient algorithm for the proximity connected two center problem ⋮ The Euclidean \(k\)-supplier problem in \(I R^2\) ⋮ COMPUTING k CENTERS OVER STREAMING DATA FOR SMALL k ⋮ The parameterized hardness of the \(k\)-center problem in transportation networks ⋮ Clustering with faulty centers ⋮ Structural parameters, tight bounds, and approximation for \((k, r)\)-center ⋮ Efficient \(k\)-center algorithms for planar points in convex position ⋮ Theory and application of width bounded geometric separators ⋮ The 2-center problem in three dimensions ⋮ A PTAS for the cardinality constrained covering with unit balls ⋮ Graph clustering ⋮ FINDING PLANAR REGIONS IN A TERRAIN – IN PRACTICE AND WITH A GUARANTEE ⋮ The computational complexity and approximability of a series of geometric covering problems ⋮ THE ALIGNED K-CENTER PROBLEM ⋮ Fixed-parameter approximations for \(k\)-center problems in low highway dimension graphs ⋮ Unit disk cover problem in 2D ⋮ Near-linear time approximation schemes for geometric maximum coverage ⋮ The within-strip discrete unit disk cover problem ⋮ An improved approximation algorithm for the most points covering problem ⋮ A simple linear algorithm for computing rectilinear 3-centers ⋮ Bichromatic 2-center of pairs of points ⋮ Covering convex polygons by two congruent disks ⋮ On the Discrete Unit Disk Cover Problem ⋮ Some Estimates on the Discretization of Geometric Center-Based Problems in High Dimensions ⋮ Aggregation error for location models: Survey and analysis ⋮ Covering a set of line segments with a few squares ⋮ Covering a set of line segments with a few squares ⋮ Unnamed Item ⋮ On interval and circular-arc covering problems ⋮ Lagrangean duals and exact solution to the capacitated \(p\)-center problem ⋮ The Parameterized Hardness of the k-Center Problem in Transportation Networks ⋮ Approximate Range Queries for Clustering ⋮ Constrained k-Center Problem on a Convex Polygon ⋮ Covering convex polygons by two congruent disks ⋮ On capacitated covering with unit balls
This page was built for publication: Exact and approximation algorithms for clustering
