Random Rates for 0-Extension and Low-Diameter Decompositions
Data Structures and Algorithms
2013-07-23 v1
Abstract
Consider the problem of partitioning an arbitrary metric space into pieces of diameter at most \Delta, such every pair of points is separated with relatively low probability. We propose a rate-based algorithm inspired by multiplicatively-weighted Voronoi diagrams, and prove it has optimal trade-offs. This also gives us another logarithmic approximation algorithm for the 0-extension problem.
Cite
@article{arxiv.1307.5582,
title = {Random Rates for 0-Extension and Low-Diameter Decompositions},
author = {Anupam Gupta and Kunal Talwar},
journal= {arXiv preprint arXiv:1307.5582},
year = {2013}
}