Minimum-cost load-balancing partitions
DOI10.1007/s00453-007-9125-3zbMath1191.68754OpenAlexW2022625151MaRDI QIDQ834581
Matthew J. Katz, Paz Carmi, Boris Aronov
Publication date: 27 August 2009
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-007-9125-3
load balancingapproximation algorithmsgeometric optimizationfatnessadditive-weighted Voronoi diagramfat partitions
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Approximation algorithms (68W25)
Related Items (9)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minkowski-type theorems and least-squares clustering
- Geographic quorum system approximations
- Sharp quantum versus classical query complexity separations
- On the Fermat-Weber center of a convex object
- E 11 and M theory
- Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications
- On the Continuous Fermat-Weber Problem
This page was built for publication: Minimum-cost load-balancing partitions