Sequential Metric Dimension - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2018

Sequential Metric Dimension


Seager introduced the following game in 2013. An invisible and immobile target is hidden at some vertex of a graph $G$. Every step, one vertex $v$ of $G$ can be probed which results in the knowledge of the distance between $v$ and the target. The objective of the game is to minimize the number of steps needed to locate the target, wherever it is. We address the generalization of this game where $k ≥ 1$ vertices can be probed at every step. Our game also generalizes the notion of the metric dimension of a graph. Precisely, given a graph $G$ and two integers $k, ≥ 1$, the Localization Problem asks whether there exists a strategy to locate a target hidden in $G$ in at most steps by probing at most $k$ vertices per step. We show this problem is NP-complete when $k$ (resp.,) is a fixed parameter. Our main results are for the class of trees where we prove this problem is NP-complete when $k$ and are part of the input but, despite this, we design a polynomial-time (+1)-approximation algorithm in trees which gives a solution using at most one more step than the optimal one. It follows that the Localization Problem is polynomial-time solvable in trees if $k$ is fixed.
Fichier principal
Vignette du fichier
localizationWAOA18.pdf (417.19 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01883712 , version 1 (28-09-2018)
hal-01883712 , version 2 (06-05-2019)


  • HAL Id : hal-01883712 , version 2


Julien Bensmail, Dorian Mazauric, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes. Sequential Metric Dimension. 16th Workshop on Approximation and Online Algorithms (WAOA 2018), Aug 2018, Helsinki, Finland. pp.36-50. ⟨hal-01883712v2⟩
376 View
113 Download


Gmail Facebook X LinkedIn More