The Euclidean k-Supplier Problem

DOI10.1287/moor.2018.0953zbMath1442.90169OpenAlexW2965394841MaRDI QIDQ5108254

Viswanath Nagarajan, Baruch Schieber, Hadas Shachnai

Publication date: 30 April 2020

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.2018.0953

zbMATH Keywords

facility locationapproximation algorithmsanalysis of algorithms: suboptimal algorithms

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Approximation algorithms (68W25)

Related Items (3)

The Euclidean \(k\)-supplier problem in \(I R^2\) ⋮ On some variants of Euclidean \(k\)-supplier ⋮ Approximability of the dispersed \(\vec{p}\)-neighbor \(k\)-supplier problem

Cites Work

• Unnamed Item
• Matroid and knapsack center problems
• Centrality of trees for capacitated \(k\)-center
• Clustering to minimize the maximum intercluster distance
• Approximate nearest neighbor queries revisited
• Approximate minimum weight matching on points in k-dimensional space
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Maximum matchings in planar graphs via Gaussian elimination
• Geometry Helps in Matching
• An optimal algorithm for approximate nearest neighbor searching fixed dimensions
• Approximation Algorithms for Data Placement Problems
• 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
• AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem
• The Capacitated K-Center Problem
• Improved Approximation Algorithms for Matroid and Knapsack Median Problems and Applications
• Facility Location with Matroid or Knapsack Constraints

This page was built for publication: The Euclidean k-Supplier Problem