Article ID: | iaor20052283 |
Country: | Netherlands |
Volume: | 26 |
Issue: | 3 |
Start Page Number: | 111 |
End Page Number: | 116 |
Publication Date: | Mar 2000 |
Journal: | Operations Research Letters |
Authors: | Provan J. Scott, Luebke Emily Larson |
Keywords: | computational analysis |
We consider the problem of finding a minimum Euclidean length graph 2-connecting a set of points in the plane. We show that the solution to this problem is an edge-disjoint union of full Steiner trees. This has three important corollaries. The first is a proof that the problem is NP-hard, even in the sense of finding a fully polynomial approximation scheme. The second is a complete description of the solutions for 2SNPP for rectangular arrays of lattice points. The third is a linear-time algorithm for constructing an optimal solution to 2SNPP given its topological description.