TY - GEN
T1 - Steiner point removal with distortion O(log k)
AU - Filtser, Arnold
N1 - Publisher Copyright:
© Copyright 2018 by SIAM.
PY - 2018/1/1
Y1 - 2018/1/1
N2 - In the Steiner point removal (SPR) problem, we are given a weighted graph G = (V;E) and a set of terminals K § V of size k. The objective is to find a minor M of G with only the terminals as its vertex set, such that the distance between the terminals will be preserved up to a small multiplicative distortion. Kamma, Krauthgamer and Nguyen [KKN15] used a ball-growing algorithm with exponential distributions to show that the distortion is at most O(log5 k). Cheung [Che18] improved the analysis of the same algorithm, bounding the distortion by O(log2 k). We improve the analysis of this ball-growing algorithm even further, bounding the distortion by O(log k).
AB - In the Steiner point removal (SPR) problem, we are given a weighted graph G = (V;E) and a set of terminals K § V of size k. The objective is to find a minor M of G with only the terminals as its vertex set, such that the distance between the terminals will be preserved up to a small multiplicative distortion. Kamma, Krauthgamer and Nguyen [KKN15] used a ball-growing algorithm with exponential distributions to show that the distortion is at most O(log5 k). Cheung [Che18] improved the analysis of the same algorithm, bounding the distortion by O(log2 k). We improve the analysis of this ball-growing algorithm even further, bounding the distortion by O(log k).
UR - http://www.scopus.com/inward/record.url?scp=85045537308&partnerID=8YFLogxK
U2 - 10.1137/1.9781611975031.90
DO - 10.1137/1.9781611975031.90
M3 - Conference contribution
AN - SCOPUS:85045537308
T3 - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
SP - 1361
EP - 1373
BT - 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018
A2 - Czumaj, Artur
PB - Association for Computing Machinery
T2 - 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018
Y2 - 7 January 2018 through 10 January 2018
ER -