Tracking paths
DOI10.1007/978-3-319-57586-5_7zbMATH Open1468.68144OpenAlexW4253053485MaRDI QIDQ5283356FDOQ5283356
Authors: Aritra Banik, Eli Packer, Marina Simakov, Matthew J. Katz 
Publication date: 21 July 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-57586-5_7
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Cites Work
- A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
- Computational geometry. Algorithms and applications.
- On the hardness of approximating minimum vertex cover
- Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference
- A new approach to the minimum cut problem
Cited In (15)
- A polynomial sized kernel for tracking paths problem
- Tracking routes in communication networks
- How to catch marathon cheaters: new approximation algorithms for tracking paths
- On a method of pursuit in ``tracks
- Polynomial time algorithms for tracking path problems
- Finding tracks detected by a drift tube system
- Title not available (Why is that?)
- Tracking paths
- A polynomial sized kernel for tracking paths problem
- Structural parameterizations of Tracking Paths problem
- Trail saving on backtrack
- Walking through waypoints
- Steps and traces
- Polynomial Time Algorithms for Tracking Path Problems
- Fixed-parameter tractable algorithms for tracking shortest paths
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 Q5283356)
