scientific article; zbMATH DE number 7525470
From MaRDI portal
Publication:5075771
DOI10.4230/LIPIcs.ESA.2019.33MaRDI QIDQ5075771
Vincent Cohen-Addad, Michał Pilipczuk, Marcin Pilipczuk
Publication date: 11 May 2022
Full work available at URL: https://arxiv.org/abs/1905.00656
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Cites Work
- Unnamed Item
- On approximate geometric \(k\)-clustering
- A 1.488 approximation algorithm for the uncapacitated facility location problem
- Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications
- Linear-time approximation schemes for clustering problems in any dimensions
- Approximation schemes for clustering problems
- Heuristics for the fixed cost median problem
- Greedy Strikes Back: Improved Facility Location Algorithms
- Quasi-Polynomial Time Approximation Scheme for Sparse Subsets of Polygons
- Local Search Heuristics for k-Median and Facility Location Problems
- An Improved Approximation for k -Median and Positive Correlation in Budgeted Optimization
- A unified framework for approximating and clustering data
This page was built for publication:
