Tracking Paths
From MaRDI portal
Publication:5283356
DOI10.1007/978-3-319-57586-5_7zbMath1468.68144OpenAlexW4253053485MaRDI QIDQ5283356
Eli Packer, Aritra Banik, 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
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (7)
Polynomial Time Algorithms for Tracking Path Problems ⋮ How to catch marathon cheaters: new approximation algorithms for tracking paths ⋮ Polynomial time algorithms for tracking path problems ⋮ Fixed-parameter tractable algorithms for tracking shortest paths ⋮ Tracking routes in communication networks ⋮ A polynomial sized kernel for tracking paths problem ⋮ Structural parameterizations of Tracking Paths problem
Cites Work
- 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
- A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
- Unnamed Item
This page was built for publication: Tracking Paths
