On the continuous Weber and k -median problems (extended abstract)

DOI10.1145/336154.336182zbMath1377.90054OpenAlexW2042544091MaRDI QIDQ5361517

Karin Weinbrecht, Sándor P. Fekete, Joseph S. B. Mitchell

Publication date: 29 September 2017

Published in: Proceedings of the sixteenth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/336154.336182

Mathematics Subject Classification ID

Continuous location (90B85) Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (10)

Integer point sets minimizing average pairwise \(L_{1}\) distance: What is the optimal shape of a town? ⋮ Algebraic properties of location problems with one circular barrier. ⋮ On the upper bound on the average distance from the Fermat-Weber center of a convex body ⋮ New bounds on the average distance from the Fermat-Weber center of a planar convex body ⋮ Discrete Voronoi games and \(\epsilon\)-nets, in two and three dimensions ⋮ The one-round Voronoi game replayed ⋮ Improved bounds on the average distance to the Fermat-Weber center of a convex object ⋮ Facility location problems with uncertainty on the plane ⋮ On the Fermat-Weber center of a convex object ⋮ A New Approach to the Upper Bound on the Average Distance from the Fermat-Weber Center of a Convex Body

This page was built for publication: On the continuous Weber and k -median problems (extended abstract)