On the upper bound on the average distance from the Fermat-Weber center of a convex body
From MaRDI portal
Publication:2230395
DOI10.1016/j.comgeo.2021.101769OpenAlexW3141545440MaRDI QIDQ2230395
Publication date: 17 September 2021
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2021.101769
Algorithms in computer science (68Wxx) Numerical approximation and computational geometry (primarily algorithms) (65Dxx) Operations research and management science (90Bxx) General convexity (52Axx) Computing methodologies and applications (68Uxx)
Cites Work
- Unnamed Item
- Unnamed Item
- New bounds on the average distance from the Fermat-Weber center of a planar convex body
- Minimum-cost load-balancing partitions
- Improved bounds on the average distance to the Fermat-Weber center of a convex object
- Practical methods for approximating shortest paths on a convex polytope in \(\mathbb{R}^3\)
- On the Fermat-Weber center of a convex object
- Research Problems in Discrete Geometry
- On the continuous Weber and k -median problems (extended abstract)
This page was built for publication: On the upper bound on the average distance from the Fermat-Weber center of a convex body