Steiner point removal with distortion O(log k)

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

10 Scopus citations

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 languageEnglish
Title of host publication29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018
EditorsArtur Czumaj
PublisherAssociation for Computing Machinery
Pages1361-1373
Number of pages13
ISBN (Electronic)9781611975031
DOIs
StatePublished - 2018
Externally publishedYes
Event29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018 - New Orleans, United States
Duration: 7 Jan 201810 Jan 2018

Publication series

NameProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Conference

Conference29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018
Country/TerritoryUnited States
CityNew Orleans
Period7/01/1810/01/18

Bibliographical note

Publisher Copyright:
© Copyright 2018 by SIAM.

Fingerprint

Dive into the research topics of 'Steiner point removal with distortion O(log k)'. Together they form a unique fingerprint.

Cite this