2020-03-112020-03-112018Garijo Royo, D., Márquez Pérez, A., Rodríguez, N. y Silveira, R.I. (2018). Computing Optimal Shortcuts for Networks. En ISAAC 2018: 29th International Symposium on Algorithms and Computation (15-1-15-12), Jiaoxi, Yilan, Taiwan: Dagsthul Publishing.978-3-95977-094-11868-8969https://hdl.handle.net/11441/94101We study augmenting a plane Euclidean network with a segment, called shortcut, to minimize the largest distance between any two points along the edges of the resulting network. Questions of this type have received considerable attention recently, mostly for discrete variants of the problem. We study a fully continuous setting, where all points on the network and the inserted segment must be taken into account. We present the first results on the computation of optimal shortcuts for general networks in this model, together with several results for networks that are paths, restricted to two types of shortcuts: shortcuts with a fixed orientation and simple shortcuts.application/pdf12engAttribution-NonCommercial-NoDerivatives 4.0 Internacionalhttp://creativecommons.org/licenses/by-nc-nd/4.0/Graph augmentationShortcutDiameterGeometric graphinfo:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/openAccess