Steiner Point Removal โ Distant Terminals Don't (Really) Bother
Steiner Point Removal โ Distant Terminals Don't (Really) Bother
Given a weighted graph G = (V, E, w) with a set of k terminals T โ V, the Steiner Point Removal problem seeks for a minor of the graph with vertex set T, such that the distance between every pair of terminals is preserved within a small multiplicative distortion. โฆ