Luebke and Provan proved that the Euclidean 2-connected Steiner network problem is NP-hard, which means that there are few possibilities of existing a polynomial time algorithm for a general finite set P of points in the Euclidean plane.

• Luebke和Provan证明了欧几里德2-连通Steiner网络问题是NP-困难的。 这意味着对一般的平面有限点集而言,不大可能存在求解这个问题的多项式时间算法。