Skip to main content
Log in

A Polynomial Sized Kernel for Tracking Paths Problem

Algorithmica Aims and scope Submit manuscript

Abstract

Consider a secure environment (say an airport) that has a unique entry and a unique exit point with multiple inter-crossing paths between them. We want to place (minimum number of) trackers (or check points) at some specific intersections so that based on the sequence of trackers a person has encountered, we can identify the exact path traversed by the person. Motivated by such applications, we study the Tracking Paths problem in this paper. Given an undirected graph with a source s, a destination t and a non-negative integer k, the goal is to find a set of at most k vertices, a tracking set, that intersects each st path in a unique sequence. Such a set enables a central controller to track all the paths from s to t. We first show that the problem is NP-complete. Then we show that finding a tracking set of size at most k is fixed-parameter tractable when parameterized by the solution size. More specifically, given an undirected graph on n vertices and an integer k, we give a polynomial time algorithm that either determines that the graph cannot be tracked by k trackers or produces an equivalent instance with \(\mathcal {O}(k^7)\) edges.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13

References

  1. Bafna, V., Berman, P., Fujito, T.: A 2-approximation algorithm for the undirected feedback vertex set problem. SIAM J. Discrete Math. 12(3), 289–297 (1999)

    Article  MathSciNet  Google Scholar 

  2. Banik, A., Katz, M.J., Packer, E., Simakov, M.: Tracking paths. In: Algorithms and Complexity—10th International Conference, CIAC 2017, pp. 67–79 (2017)

    Google Scholar 

  3. Bhatti, S., Xu, J.: Survey of target tracking protocols using wireless sensor network. In: 2009 Fifth International Conference on Wireless and Mobile Communications, pp. 110–115 (2009)

  4. Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms, 1st edn. Springer, Berlin (2015)

    Book  Google Scholar 

  5. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Berlin (1999)

    Book  Google Scholar 

  6. Gupta, R., Das, S.R.: Tracking moving targets in a smart sensor network. In: IEEE 58th Vehicular Technology Conference, vol. 5, pp. 3035–3039 (2003)

  7. Harary, F., Melter, R.A.: On the metric dimension of a graph. Ars. Comb. 2(191–195), 1 (1976)

    MATH  Google Scholar 

  8. Hernando, C., Mora, M., Pelayo, I.M., Seara, C., Wood, D.R.: Extremal graph theory for metric dimension and diameter. Electron. J. Comb. 17(1), R30 (2010)

    MathSciNet  MATH  Google Scholar 

  9. Karp, R.M.: Reducibility Among Combinatorial Problems. Springer, Berlin (1972)

    Book  Google Scholar 

  10. Kawarabayashi, K., Kobayashi, Y., Reed, B.: The disjoint paths problem in quadratic time. J. Comb. Theory Ser. B 102(2), 424–435 (2012)

    Article  MathSciNet  Google Scholar 

  11. Khuller, S., Raghavachari, B., Rosenfeld, A.: Landmarks in graphs. Discrete Appl. Math. 70(3), 217–229 (1996)

    Article  MathSciNet  Google Scholar 

  12. Kociumaka, T., Pilipczuk, M.: Faster deterministic feedback vertex set. Inf. Process. Lett. 114(10), 556 (2014)

    Article  MathSciNet  Google Scholar 

  13. Peng, T., Leckie, C., Ramamohanarao, K.: Survey of network-based defense mechanisms countering the DoS and DDoS problems. ACM Comput. Surv. 39(1), 3 (2007)

    Article  Google Scholar 

  14. Slater, P.J.: Leaves of trees. Congr. Numer. 14(549–559), 37 (1975)

    MATH  Google Scholar 

  15. Snoeren, A.C., Partridge, C., Sanchez, L.A., Jones, C.E., Tchakountio, F., Kent, S.T., Strayer, W.T.: Hash-based ip traceback. SIGCOMM Comput. Commun. Rev. 31(4), 3–14 (2001)

    Article  Google Scholar 

  16. Thomassé, S.: A \(4k^2\) kernel for feedback vertex set. ACM Trans. Algorithms (TALG) 6(2), 32 (2010)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Pratibha Choudhary.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Banik, A., Choudhary, P., Lokshtanov, D. et al. A Polynomial Sized Kernel for Tracking Paths Problem. Algorithmica 82, 41–63 (2020). https://doi.org/10.1007/s00453-019-00602-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-019-00602-8

Keywords

Navigation