Relaxed Voronoi: A Simple Framework for Terminal-Clustering Problems
We reprove three known algorithmic bounds for terminal-clustering problems, using a single framework that leads to simpler proofs. In this genre of problems, the input is a metric space (X,d) (possibly arising from a graph) and a subset of terminals K subset X, and the goal is to partition the points X such that each part, called a cluster, contains exactly one terminal (possibly with connectivity requirements) so as to minimize some objective. The three bounds we reprove are for Steiner Point Removal on trees [Gupta, SODA 2001], for Metric 0-Extension in bounded doubling dimension [Lee and Naor, unpublished 2003], and for Connected Metric 0-Extension [Englert et al., SICOMP 2014].
A natural approach is to cluster each point with its closest terminal, which would partition X into so-called Voronoi cells, but this approach can fail miserably due to its stringent cluster boundaries. A now-standard fix, which we call the Relaxed-Voronoi framework, is to use enlarged Voronoi cells, but to obtain disjoint clusters, the cells are computed greedily according to some order. This method, first proposed by Calinescu, Karloff and Rabani [SICOMP 2004], was employed successfully to provide state-of-the-art results for terminal-clustering problems on general metrics. However, for restricted families of metrics, e.g., trees and doubling metrics, only more complicated, ad-hoc algorithms are known. Our main contribution is to demonstrate that the Relaxed-Voronoi algorithm is applicable to restricted metrics, and actually leads to relatively simple algorithms and analyses.
Clustering
Steiner point removal
Zero extension
Doubling dimension
Relaxed voronoi
10:1-10:14
Regular Paper
Arnold
Filtser
Arnold Filtser
Robert
Krauthgamer
Robert Krauthgamer
Ohad
Trabelsi
Ohad Trabelsi
10.4230/OASIcs.SOSA.2019.10
Aaron Archer, Jittat Fakcharoenphol, Chris Harrelson, Robert Krauthgamer, Kunal Talwar, and Éva Tardos. Approximate classification via earthmover metrics. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '04, pages 1079-1087, 2004. URL: http://dl.acm.org/citation.cfm?id=982792.982952.
http://dl.acm.org/citation.cfm?id=982792.982952
A. Basu and A. Gupta. Steiner Point Removal in Graph Metrics. Unpublished Manuscript, available from http://www.math.ucdavis.edu/~abasu/papers/SPR.pdf, 2008.
http://www.math.ucdavis.edu/~abasu/papers/SPR.pdf
Gruia Călinescu, Howard J. Karloff, and Yuval Rabani. Approximation Algorithms for the 0-Extension Problem. SIAM J. Comput., 34(2):358-372, 2004. URL: http://dx.doi.org/10.1137/S0097539701395978.
http://dx.doi.org/10.1137/S0097539701395978
T.-H. Chan, Donglin Xia, Goran Konjevod, and Andrea Richa. A Tight Lower Bound for the Steiner Point Removal Problem on Trees. In Proceedings of the 9th International Conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th International Conference on Randomization and Computation, APPROX'06/RANDOM'06, pages 70-81, 2006. URL: http://dx.doi.org/10.1007/11830924_9.
http://dx.doi.org/10.1007/11830924_9
Yun Kuen Cheung. Steiner Point Removal - Distant Terminals Don't (Really) Bother. In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, pages 1353-1360, 2018. URL: http://dx.doi.org/10.1137/1.9781611975031.89.
http://dx.doi.org/10.1137/1.9781611975031.89
Elias Dahlhaus, David S. Johnson, Christos H. Papadimitriou, Paul D. Seymour, and Mihalis Yannakakis. The Complexity of Multiway Cuts (Extended Abstract). In Proceedings of the 24th Annual ACM Symposium on Theory of Computing, STOC 1992, pages 241-251, 1992. URL: http://dx.doi.org/10.1145/129712.129736.
http://dx.doi.org/10.1145/129712.129736
Matthias Englert, Anupam Gupta, Robert Krauthgamer, Harald Räcke, Inbal Talgam-Cohen, and Kunal Talwar. Vertex Sparsifiers: New Results from Old Techniques. SIAM J. Comput., 43(4):1239-1262, 2014. URL: http://dx.doi.org/10.1137/130908440.
http://dx.doi.org/10.1137/130908440
Jittat Fakcharoenphol, Chris Harrelson, Satish Rao, and Kunal Talwar. An improved approximation algorithm for the 0-extension problem. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '03, pages 257-265, 2003. URL: http://dl.acm.org/citation.cfm?id=644108.644153.
http://dl.acm.org/citation.cfm?id=644108.644153
Arnold Filtser. Steiner Point Removal with Distortion O(log k). In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, pages 1361-1373, 2018. URL: http://dx.doi.org/10.1137/1.9781611975031.90.
http://dx.doi.org/10.1137/1.9781611975031.90
Arnold Filtser. Steiner Point Removal with distortion O(log k), using the Noisy-Voronoi algorithm. CoRR, abs/1808.02800, 2018. URL: http://arxiv.org/abs/1808.02800.
http://arxiv.org/abs/1808.02800
Michael L. Fredman and Robert Endre Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM, 34(3):596-615, 1987. URL: http://dx.doi.org/10.1145/28869.28874.
http://dx.doi.org/10.1145/28869.28874
Teofilo F. Gonzalez. Clustering to Minimize the Maximum Intercluster Distance. Theor. Comput. Sci., 38:293-306, 1985. URL: http://dx.doi.org/10.1016/0304-3975(85)90224-5.
http://dx.doi.org/10.1016/0304-3975(85)90224-5
Anupam Gupta. Steiner Points in Tree Metrics Don'T (Really) Help. In Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '01, pages 220-227, 2001. URL: http://dl.acm.org/citation.cfm?id=365411.365448.
http://dl.acm.org/citation.cfm?id=365411.365448
Anupam Gupta, Robert Krauthgamer, and James R. Lee. Bounded Geometries, Fractals, and Low-Distortion Embeddings. In 44th Symposium on Foundations of Computer Science (FOCS 2003), pages 534-543, 2003. URL: http://dx.doi.org/10.1109/SFCS.2003.1238226.
http://dx.doi.org/10.1109/SFCS.2003.1238226
Anupam Gupta and Kunal Talwar. Random Rates for 0-Extension and Low-Diameter Decompositions. CoRR, abs/1307.5582, 2013. URL: http://arxiv.org/abs/1307.5582.
http://arxiv.org/abs/1307.5582
Lior Kamma, Robert Krauthgamer, and Huy L. Nguyen. Cutting Corners Cheaply, or How to Remove Steiner Points. SIAM J. Comput., 44(4):975-995, 2015. URL: http://dx.doi.org/10.1137/140951382.
http://dx.doi.org/10.1137/140951382
Alexander V. Karzanov. Minimum 0-Extensions of Graph Metrics. Eur. J. Comb., 19(1):71-101, 1998. URL: http://dx.doi.org/10.1006/eujc.1997.0154.
http://dx.doi.org/10.1006/eujc.1997.0154
Jon M. Kleinberg and Éva Tardos. Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields. J. ACM, 49(5):616-639, 2002. URL: http://dx.doi.org/10.1145/585265.585268.
http://dx.doi.org/10.1145/585265.585268
James R. Lee and Assaf Naor. Metric decomposition, smooth measures, and clustering. Unpublished Manuscript, available from https://www.math.nyu.edu/~naor/homepage%20files/cluster.pdf, 2003.
https://www.math.nyu.edu/~naor/homepage%20files/cluster.pdf
Gary L. Miller, Richard Peng, and Shen Chen Xu. Parallel graph decompositions using random shifts. In 25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '13, pages 196-203, 2013. URL: http://dx.doi.org/10.1145/2486159.2486180.
http://dx.doi.org/10.1145/2486159.2486180
Creative Commons Attribution 3.0 Unported license
https://creativecommons.org/licenses/by/3.0/legalcode