Abstract
The Euclidean Steiner Augmentation Problem has as input a set of straight line segments drawn in the Euclidean plane, and has as output the smallest set of straight line segments, in terms of total Euclidean length, whose addition will make the resulting set 2-edge connected. A fully polynomial approximation scheme is given for this problem in the case where the input set is connected. Several extensions and variants are also discussed.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
