Tracking paths
From MaRDI portal
Publication:5283356
Recommendations
Cites work
- A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
- A new approach to the minimum cut problem
- Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference
- Computational geometry. Algorithms and applications.
- On the hardness of approximating minimum vertex cover
Cited in
(15)- Polynomial time algorithms for tracking path problems
- How to catch marathon cheaters: new approximation algorithms for tracking paths
- Fixed-parameter tractable algorithms for tracking shortest paths
- scientific article; zbMATH DE number 1001517 (Why is no real title available?)
- Finding tracks detected by a drift tube system
- A polynomial sized kernel for tracking paths problem
- Tracking routes in communication networks
- Trail saving on backtrack
- Walking through waypoints
- Tracking paths
- On a method of pursuit in ``tracks
- Steps and traces
- Structural parameterizations of Tracking Paths problem
- Polynomial Time Algorithms for Tracking Path Problems
- A polynomial sized kernel for tracking paths problem
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)