Clustering through continuous facility location problems
DOI10.1016/J.TCS.2016.10.001zbMATH Open1357.90082OpenAlexW2533751695MaRDI QIDQ346248FDOQ346248
Authors: Luis A. A. Meira, Flávio K. Miyazawa, Lehilton L. C. Pedrosa 
Publication date: 5 December 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.10.001
Recommendations
- Local search approximation algorithms for the sum of squares facility location problems
- A constant-factor approximation algorithm for the \(k\)-median problem (extended abstract)
- A local search approximation algorithm for a squared metric \(k\)-facility location problem
- A constant-factor approximation algorithm for the \(k\)-median problem
- Approximation schemes for clustering problems
approximation algorithms\(k\)-clusteringapproximate center setscontinuous facility location problemrandom sampling procedure
Approximation methods and heuristics in mathematical programming (90C59) Continuous location (90B85)
Cites Work
- Least squares quantization in PCM
- Approximation Algorithms for the Set Covering and Vertex Cover Problems
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Greedy Strikes Back: Improved Facility Location Algorithms
- A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
- A new greedy approach for facility location problems
- Title not available (Why is that?)
- An Improved Approximation for k-median, and Positive Correlation in Budgeted Optimization
- Linear-time approximation schemes for clustering problems in any dimensions
- On approximate geometric \(k\)-clustering
- A Nearly Linear-Time Approximation Scheme for the Euclidean k-Median Problem
- Approximate clustering via core-sets
- Title not available (Why is that?)
- On coresets for k-means and k-median clustering
- Approximation schemes for clustering problems
- On k-Median clustering in high dimensions
- A PTAS for k-means clustering based on weak coresets
- The Planar k-Means Problem is NP-Hard
- Title not available (Why is that?)
- A local search approximation algorithm for \(k\)-means clustering
- The hardness of approximation of Euclidean \(k\)-means
- Smaller coresets for \(k\)-median and \(k\)-means clustering
- \((1 + \varepsilon)\)-approximation for facility location in data streams
- A systematic approach to bound factor revealing LPs and its application to the metric and squared metric facility location problems
Cited In (7)
- Local search approximation algorithms for the sum of squares facility location problems
- New variants of the simple plant location problem and applications
- Using clustering analysis in a capacitated location-routing problem
- Linear-size universal discretization of geometric center-based problems in fixed dimensions
- Continuous facility location on graphs
- A clustering approach to the planar hub location problem
- Some Estimates on the Discretization of Geometric Center-Based Problems in High Dimensions
This page was built for publication: Clustering through continuous facility location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q346248)
