activity
20132016
most citedA Note on the Unsolvability of the Weighted Region Shortest Path Problem

2 citations · 4 across the 4 of their papers we have counts for

collaborators
Showing 2015 · cs.CGShow all

1 paper · 2 filters

cs.CG2015

Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts

Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari +1

We seek to augment a geometric network in the Euclidean plane with shortcuts to minimize its continuous diameter, i.e., the largest network distance between any two points on the a…