Computing optimal shortcuts for networks
Rights accessRestricted access - publisher's policy (embargoed until 2021-11-16)
We study augmenting a plane Euclidean network with a segment, called a shortcut, to minimize the largest distance between any two points along the edges of the resulting network. Problems of this type have received considerable attention recently, mostly for discrete variants of the problem. We consider a fully continuous setting, where the problem of computing distances and placing a shortcut is much harder as all points on the network, instead of only the vertices, must be taken into account. We present the first results on the computation of optimal shortcuts for general networks in this model: a polynomial time algorithm and a discretization of the problem that leads to an approximation algorithm. We also improve the general method for networks that are paths, restricted to two types of shortcuts: those with a fixed orientation and simple shortcuts.
CitationGarijo, D. [et al.]. Computing optimal shortcuts for networks. "European journal of operational research", 16 Novembre 2019, vol. 279, núm. 1, p. 26-37.
|1807.10093.pdf||arXiv version||962,5Kb||Restricted access|