2020/12/18 · In this paper, we consider the parameterized complexity of the problem of tracking shortest st paths in graphs and some related versions of the problem.

2020/01/24 · We consider the parameterized complexity of the problem of tracking shortest st paths in graphs, motivated by applications in security and wireless networks.

We consider the parameterized complexity of the problem of tracking shortest s-t paths in graphs, motivated by applications in security and wireless ...

We consider the parameterized complexity of the problem of tracking shortest s-t paths in graphs, motivated by applications in security and wireless networks.

2020/01/24 · This work derives a factor 66-approximation algorithm for Tracking Paths in weighted graphs and a factor 4-app approximation algorithm if ...

2020/08/18 · While the results for Tracking Set System show that Tracking Short- est Paths is fixed-parameter tractable, we also give an independent ...

Bibliographic details on Fixed-parameter tractable algorithms for Tracking Shortest Paths.

Fixed-parameter tractable algorithms for Tracking Shortest Paths. Banik, A.; Choudhary, P.; Raman, V.; Saurabh, S. Theoretical Computer Science 846: 1-13.

Fixed-Parameter Tractable Algorithms for Tracking Set Problems. A Banik, P Choudhary. Conference on Algorithms and Discrete Applied Mathematics, 93-104, 2018.

Fixed-Parameter Tractable Algorithms for Tracking Set Problems. A Banik, P Choudhary. Conference on Algorithms and Discrete Applied Mathematics, 93-104, 2018.