Abstract
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).
| Original language | English |
|---|---|
| Title of host publication | 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018 |
| Editors | Artur Czumaj |
| Publisher | Association for Computing Machinery |
| Pages | 1361-1373 |
| Number of pages | 13 |
| ISBN (Electronic) | 9781611975031 |
| DOIs | |
| State | Published - 2018 |
| Externally published | Yes |
| Event | 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018 - New Orleans, United States Duration: 7 Jan 2018 → 10 Jan 2018 |
Publication series
| Name | Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms |
|---|
Conference
| Conference | 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018 |
|---|---|
| Country/Territory | United States |
| City | New Orleans |
| Period | 7/01/18 → 10/01/18 |
Bibliographical note
Publisher Copyright:© Copyright 2018 by SIAM.