A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Centroidal localization game
[article]

2018
*
arXiv
*
pre-print

One important problem in a network is to locate an (invisible) moving entity by using distance-detectors placed at strategical locations. For instance, the metric dimension of a graph G is the minimum number k of detectors placed in some vertices {v_1,...,v_k} such that the vector (d_1,...,d_k) of the distances d(v_i,r) between the detectors and the entity's location r allows to uniquely determine r ∈ V(G). In a more realistic setting, instead of getting the exact distance information, given

arXiv:1711.08836v2
fatcat:x6jeq37v35a77dnxi3lmxvfnwa