Minimum-cost load-balancing partitions
From MaRDI portal
Publication:834581
DOI10.1007/s00453-007-9125-3zbMath1191.68754MaRDI 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 balancing; approximation algorithms; geometric optimization; fatness; additive-weighted Voronoi diagram; fat partitions
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
05C10: Planar graphs; geometric and topological aspects of graph theory
65D18: Numerical aspects of computer graphics, image analysis, and computational geometry
68W25: Approximation algorithms
Related Items
A faster algorithm for the constrained minimum covering circle problem to expedite solving p‐center problems in an irregularly shaped area with holes, Geometric partitioning and robust ad-hoc network design, New bounds on the average distance from the Fermat-Weber center of a planar convex body, Constrained clustering via diagrams: a unified theory and its application to electoral district design, On the upper bound on the average distance from the Fermat-Weber center of a convex body, Shadow prices in territory division, Dividing a Territory Among Several Vehicles, A New Approach to the Upper Bound on the Average Distance from the Fermat-Weber Center of a Convex Body, An Approximation Algorithm for the Continuous k-Medians Problem in a Convex Polygon
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