dc.creator | Garijo Royo, Delia | es |
dc.creator | Márquez Pérez, Alberto | es |
dc.creator | Rodríguez, Natalia | es |
dc.creator | Silveira, Rodrigo I. | es |
dc.date.accessioned | 2020-03-11T11:11:18Z | |
dc.date.available | 2020-03-11T11:11:18Z | |
dc.date.issued | 2018 | |
dc.identifier.citation | Garijo 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. | |
dc.identifier.isbn | 978-3-95977-094-1 | es |
dc.identifier.issn | 1868-8969 | es |
dc.identifier.uri | https://hdl.handle.net/11441/94101 | |
dc.description.abstract | We 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. | es |
dc.description.sponsorship | Ministerio de Economía y Competitividad MTM2015-63791-R | es |
dc.description.sponsorship | Ministerio de Economía y Competitividad BFU2016-74975-P | es |
dc.format | application/pdf | es |
dc.format.extent | 12 | es |
dc.language.iso | eng | es |
dc.publisher | Dagsthul Publishing | es |
dc.relation.ispartof | ISAAC 2018: 29th International Symposium on Algorithms and Computation (2018), p 15-1-15-12 | |
dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 Internacional | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
dc.subject | Graph augmentation | es |
dc.subject | Shortcut | es |
dc.subject | Diameter | es |
dc.subject | Geometric graph | es |
dc.title | Computing Optimal Shortcuts for Networks | es |
dc.type | info:eu-repo/semantics/conferenceObject | es |
dcterms.identifier | https://ror.org/03yxnpp24 | |
dc.type.version | info:eu-repo/semantics/publishedVersion | es |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | es |
dc.contributor.affiliation | Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII) | es |
dc.relation.projectID | MTM2015-63791-R | es |
dc.relation.projectID | BFU2016-74975-P | es |
dc.relation.publisherversion | https://drops.dagstuhl.de/portals/lipics/index.php?semnr=16094 | es |
dc.publication.initialPage | 15-1 | es |
dc.publication.endPage | 15-12 | es |
dc.eventtitle | ISAAC 2018: 29th International Symposium on Algorithms and Computation | es |
dc.eventinstitution | Jiaoxi, Yilan, Taiwan | es |
dc.relation.publicationplace | Saarbrücken, Germany | es |
dc.contributor.funder | Ministerio de Economía y Competitividad (MINECO). España | es |
dc.contributor.funder | Ministerio de Economía y Competitividad (MINECO). España | es |