A first-order approximation theorem updates Steiner point positions to recover a near-optimal tree after small perturbations to terminal nodes.
Concurrency and Computation: Practice and Experience , volume=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
eess.SY 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Optimum adaptation of a Steiner network
A first-order approximation theorem updates Steiner point positions to recover a near-optimal tree after small perturbations to terminal nodes.