Preprint
Nov 2026
Dynamic Steiner Tree under Edge Updates
The Steiner tree problem is the canonical generalization of minimum spanning tree (MST). When connectivity is required only among a fixed subset of vertices (terminals), the goal is to maintain a minimum-cost tree connecting these terminals as the graph undergoes edge updates. While dynamic MST has been studied since t...
Jeff Giliberti, M. Hajiaghayi, Mohammad Mahdavi et al.
· 0 citations