Steiner Point Removal --- Distant Terminals Don't (Really) Bother

zbMath1403.68153arXiv1703.08790MaRDI QIDQ4607977

Yun Kuen Cheung

Publication date: 15 March 2018

Full work available at URL: https://arxiv.org/abs/1703.08790

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph minors (05C83) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)

Related Items (4)

Reachability Preservers: New Extremal Bounds and Approximation Algorithms ⋮ Steiner Point Removal with Distortion $O(\log {k})$ using the Relaxed-Voronoi Algorithm ⋮ Refined Vertex Sparsifiers of Planar Graphs ⋮ Improved Guarantees for Vertex Sparsification in Planar Graphs

This page was built for publication: Steiner Point Removal --- Distant Terminals Don't (Really) Bother