Preprint
Aug 2026
Exact Algorithms for Minimum Steiner Point Trees
A deterministic exact algorithm is given that computes an optimal implicit representation of Steiner topology in $n^{O(n)}$ time, independent of $k, in the computation model of Section~\ref{subseccomputation}.
E. Woo, Donghoon Shin
· 0 citations