Publication:4542527
From MaRDI portal
zbMath1027.68979MaRDI QIDQ4542527
Prabhakar Raghavan, Sanjeev Arora, Satish B. Rao
Publication date: 17 September 2002
68W05: Nonnumerical algorithms
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
A local search approximation algorithm for \(k\)-means clustering, Facility location models for distribution system design, On the choice of aggregation points for continuous \(p\)-median problems: A case for the gravity centre, A constant-factor approximation algorithm for the \(k\)-median problem, On the bounded-hop MST problem on random Euclidean instances, Approximation schemes for node-weighted geometric Steiner tree problems, Approximation Algorithms for Buy-at-Bulk Geometric Network Design, Sublinear‐time approximation algorithms for clustering via random sampling, The two‐median problem on Manhattan meshes, Continuous reformulations and heuristics for the Euclidean travelling salesperson problem