An Approximation Algorithm for the Continuous k-Medians Problem in a Convex Polygon

DOI10.1287/ijoc.2013.0564zbMath1356.90073OpenAlexW2157465429MaRDI QIDQ2962556

Fan Jia, John Gunnar Carlsson, Ying Li

Publication date: 17 February 2017

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2013.0564

zbMATH Keywords

geometric algorithmsapproximation algorithmscontinuous location theory

Mathematics Subject Classification ID

Continuous location (90B85)

Related Items (2)

Continuous approximation formulas for location problems ⋮ On the geometric median of convex, triangular and other polygonal domains

Cites Work

• Minimum-cost load-balancing partitions
• A constant-factor approximation algorithm for the \(k\)-median problem
• Worst-Case and Probabilistic Analysis of a Geometric Location Problem
• Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
• On the Continuous Fermat-Weber Problem
• Unnamed Item
• Unnamed Item

This page was built for publication: An Approximation Algorithm for the Continuous k-Medians Problem in a Convex Polygon