Tracking Routes in Communication Networks

  • Davide Bilò
  • Luciano Gualà
  • Stefano LeucciEmail author
  • Guido Proietti
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11639)


The minimum tracking set problem is an optimization problem that deals with monitoring communication paths that can be used for exchanging point-to-point messages using as few tracking devices as possible. More precisely, a tracking set of a given graph G and a set of source-destination pairs of vertices, is a subset T of vertices of G such that the vertices in T traversed by any source-destination shortest path P uniquely identify P. The minimum tracking set problem has been introduced in [Banik et al., CIAC 2017] for the case of a single source-destination pair. There, the authors show that the problem is APX-hard and that it can be 2-approximated for the class of planar graphs, even though no hardness result is known for this case. In this paper we focus on the case of multiple source-destination pairs and we present the first \(\widetilde{O}(\sqrt{n})\)-approximation algorithm for general graphs. Moreover, we prove that the problem remains NP-hard even for cubic planar graphs and all pairs \(S \times D\), where S and D are the sets of sources and destinations, respectively. Finally, for the case of a single source-destination pair, we design an (exact) FPT algorithm w.r.t. the maximum number of vertices at the same distance from the source.


  1. 1.
    Bampas, E., Bilò, D., Drovandi, G., Gualà, L., Klasing, R., Proietti, G.: Network verification via routing table queries. J. Comput. Syst. Sci. 81(1), 234–248 (2015)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Banik, A., Choudhary, P.: Fixed-parameter tractable algorithms for tracking set problems. In: Proceedings of the 4th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2018, pp. 93–104 (2018)CrossRefGoogle Scholar
  3. 3.
    Banik, A., Choudhary, P., Lokshtanov, D., Raman, V., Saurabh, S.: A polynomial sized kernel for tracking paths problem. In: Proceedings of the 13th Latin American Symposium on Theoretical Informatics, LATIN 2018, pp. 94–107 (2018)CrossRefGoogle Scholar
  4. 4.
    Banik, A., Katz, M.J., Packer, E., Simakov, M.: Tracking paths. In: Proceedings of the 10th International Conference on Algorithms and Complexity, CIAC 2017, pp. 67–79 (2017)Google Scholar
  5. 5.
    Beerliova, Z., et al.: Network discovery and verification. IEEE J. Sel. Areas Commun. 24(12), 2168–2181 (2006)CrossRefGoogle Scholar
  6. 6.
    Harary, F., Melter, R.A.: On the metric dimension of a graph. Ars Combin. 2(191–195), 1 (1976)zbMATHGoogle Scholar
  7. 7.
    Khuller, S., Raghavachari, B., Rosenfeld, A.: Landmarks in graphs. Discrete Appl. Math. 70(3), 217–229 (1996)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Lichtenstein, D.: Planar formulae and their uses. SIAM J. Comput. 11(2), 329–343 (1982)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Department of Humanities and Social SciencesUniversity of SassariSassariItaly
  2. 2.Department of Enterprise EngineeringUniversity of Rome “Tor Vergata”RomeItaly
  3. 3.Department of Algorithms and ComplexityMax Planck Institut für InformatikSaarbrückenGermany
  4. 4.Department of Information Engineering, Computer Science and MathematicsUniversity of L’AquilaL’AquilaItaly
  5. 5.Institute for System Analysis and Computer Science “Antonio Ruberti” (IASI CNR)RomeItaly

Personalised recommendations