Abstract
We study the problem of augmenting the locus Nℓ of a plane Euclidean network N by inserting iteratively a finite set of segments, called shortcut set, while reducing the diameter of the locus of the resulting network. We first characterize the existence of shortcut sets, and compute shortcut sets in polynomial time providing an upper bound on their size. Then, we analyze the role of the convex hull of Nℓ when inserting a shortcut set. As a main result, we prove that one can always determine in polynomial time whether inserting only one segment suffices to reduce the diameter.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
