Buscar
Mostrando ítems 21-21 de 21
Artículo
Computing optimal shortcuts for networks
(ELSEVIER SCIENCE BV; ELSEVIER, 2019)
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 ...