On some variants of Euclidean \(k\)-supplier

DOI10.1016/J.ORL.2022.01.003OpenAlexW4206560154WikidataQ114143886 ScholiaQ114143886MaRDI QIDQ2670484

Viswanath Nagarajan, Lily Wang, Euiwoong Lee

Publication date: 11 March 2022

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2112.01700

zbMATH Keywords

outliersclusteringapproximation algorithmsEuclidean spaceshardness of approximation\(k\)-center

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matroid and knapsack center problems
• A factor 2 approximation algorithm for the generalized Steiner network problem
• Clustering to minimize the maximum intercluster distance
• A heuristic for the p-center problem in graphs
• Geometric algorithms and combinatorial optimization
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• A Nearly Linear-Time Approximation Scheme for the Euclidean k-Median Problem
• On coresets for k-means and k-median clustering
• A Best Possible Heuristic for the k-Center Problem
• Improved Approximation Algorithms for Matroid and Knapsack Median Problems and Applications
• Generalized Center Problems with Outliers
• The Euclidean k-Supplier Problem
• Constant approximation for k-median and k-means with outliers via iterative rounding
• Facility Location with Matroid or Knapsack Constraints
• The complexity of satisfiability problems

This page was built for publication: On some variants of Euclidean \(k\)-supplier