An exact n^{O(n)}-time algorithm computes an optimal implicit Steiner tree for STP-MSPBEL in the plane, with the bound independent of the number of Steiner points.
Approximating minimum steiner point trees in minkowski planes
1 Pith paper cite this work, alongside 5 external citations. Polarity classification is still indexing.
1
Pith paper citing it
5
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
fields
cs.CG 1years
2026 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Exact Algorithms for Minimum Steiner Point Trees
An exact n^{O(n)}-time algorithm computes an optimal implicit Steiner tree for STP-MSPBEL in the plane, with the bound independent of the number of Steiner points.