On the Geometry of Stable Steiner Tree Instances
Data Structures and Algorithms
2021-09-29 v1
Abstract
In this note we consider the Steiner tree problem under Bilu-Linial stability. We give strong geometric structural properties that need to be satisfied by stable instances. We then make use of, and strengthen, these geometric properties to show that -stable instances of Euclidean Steiner trees are polynomial-time solvable. We also provide a connection between certain approximation algorithms and Bilu-Linial stability for Steiner trees.
Keywords
Cite
@article{arxiv.2109.13457,
title = {On the Geometry of Stable Steiner Tree Instances},
author = {James Freitag and Neshat Mohammadi and Aditya Potukuchi and Lev Reyzin},
journal= {arXiv preprint arXiv:2109.13457},
year = {2021}
}
Comments
9 pages, 1 figure