Minimum k-Steiner tree;
Steiner point restrictions;
STEINER MINIMAL-TREES;
ALGORITHMS;
COMPLEXITY;
D O I:
10.1007/978-3-030-58150-3_36
中图分类号:
TP39 [计算机的应用];
学科分类号:
081203 ;
0835 ;
摘要:
Given a set P of n points in R-2 and an input line gamma, we present an algorithm that runs in optimal Theta(n log n) time and Theta(n) space to solve a restricted version of the 1-Steiner tree problem. Our algorithm returns a minimum-weight tree interconnecting P using at most one Steiner point s is an element of gamma where edges are weighted by the Euclidean distance between their endpoints.