An $\tildeΩ\big(\sqrt{\log |T|}\big)$ Lower Bound for Steiner Point Removal
Abstract: In the Steiner point removal (SPR) problem, we are given a (weighted) graph $G$ and a subset $T$ of its vertices called terminals, and the goal is to compute a (weighted) graph $H$ on $T$ that is a minor of $G$, such that the distance between every pair of terminals is preserved to within some small multiplicative factor, that is called the stretch of $H$. It has been shown that on general graphs we can achieve stretch $O(\log |T|)$ [Filtser, 2018]. On the other hand, the best-known stretch lower bound is $8$ [Chan-Xia-Konjevod-Richa, 2006], which holds even for trees. In this work, we show an improved lower bound of $\tilde\Omega\big(\sqrt{\log |T|}\big)$.
- High-girth near-ramanujan graphs with localized eigenvectors. Israel Journal of Mathematics, 246(1):1–20, 2021.
- Steiner point removal in graph metrics. Unpublished Manuscript, available from http://www. math. ucdavis. edu/~ abasu/papers/SPR. pdf, 1:25, 2008.
- Covering planar metrics (and beyond): o(1)𝑜1o(1)italic_o ( 1 ) trees suffice. arXiv:2306.06215, 2023.
- Resolving the steiner point removal problem in planar graphs via shortcut partitions. arXiv preprint arXiv:2306.06235, 2023.
- Shortcut partitions in minor-free graphs: Steiner point removal, distance oracles, tree covers, and more. arXiv preprint arXiv:2308.00555, 2023.
- 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, pages 1353–1360. SIAM, 2018.
- Approximation algorithms for the 0-extension problem. SIAM Journal on Computing, 34(2):358–372, 2005.
- A tight lower bound for the steiner point removal problem on trees. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pages 70–81. Springer, 2006.
- Arnold Filtser. Steiner point removal with distortion o (log k). In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1361–1373. SIAM, 2018.
- Arnold Filtser. Scattering and sparse partitions, and their applications. In 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020). Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2020.
- Anupam Gupta. Steiner points in tree metrics don’t (really) help. In SODA, volume 1, pages 220–227, 2001.
- o(1)𝑜1o(1)italic_o ( 1 ) steiner point removal in series-parallel graphs. arXiv preprint arXiv:2104.00750, 2021.
- Preserving terminal distances using minors. SIAM Journal on Discrete Mathematics, 28(1):127–141, 2014.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.