Tracking paths

DOI10.1016/J.DAM.2019.11.013MaRDI QIDQ2185723zbMATH OpenOpenAlexFDO

Authors Aritra Banik, Matthew J. Katz, Eli Packer, Marina Simakov

Publication date 5 June 2020

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2019.11.013

zbMATH Keywords

guardingshortest pathstarget trackingtracking paths

Mathematics Subject Classification ID

Distance in graphs (05C12) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Recommendations

• Tracking paths
• Tracking routes in communication networks
• A polynomial sized kernel for tracking paths problem
• A polynomial sized kernel for tracking paths problem
• Fixed-parameter tractable algorithms for tracking shortest paths

Cites work

• A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
• A new approach to the minimum cut problem
• Computational geometry. Algorithms and applications.
• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• On the hardness of approximating minimum vertex cover

Cited in

(19)

• Finding tracks detected by a drift tube system
• Polynomial kernels for tracking shortest paths
• Polynomial time algorithms for tracking path problems
• Fixed-parameter tractable algorithms for tracking set problems
• Trail saving on backtrack
• Improved kernels for tracking paths
• On a method of pursuit in ``tracks
• Polynomial Time Algorithms for Tracking Path Problems
• Steps and traces
• Tracking paths
• Constant factor approximation for tracking paths and fault tolerant feedback vertex set
• Walking through waypoints
• Tracking routes in communication networks
• A polynomial sized kernel for tracking paths problem
• Tracking routes in communication networks
• Constant factor approximation for tracking paths and fault tolerant feedback vertex set
• A polynomial sized kernel for tracking paths problem
• The parameterized complexity of maximum betweenness centrality
• Distance-based (and path-based) covering problems for graphs of given cyclomatic number

This page was built for publication: Tracking paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2185723)