How to catch marathon cheaters: new approximation algorithms for tracking paths
From MaRDI portal
Publication:832889
DOI10.1007/978-3-030-83508-8_32OpenAlexW3198204543MaRDI QIDQ832889FDOQ832889
Siddharth Gupta, Michael T. Goodrich, Hadi Khodabandeh, Pedro Matias
Publication date: 25 March 2022
Full work available at URL: https://arxiv.org/abs/2104.12337
approximation algorithmsgraph algorithmsfixed-parameter tractabilitygraph minorkernelizationroad networksminor-free graphs
Cites Work
- The Design of Approximation Algorithms
- Applications of a Planar Separator Theorem
- \(\epsilon\)-nets and simplex range queries
- Almost optimal set covers in finite VC-dimension
- Homomorphiesätze für Graphen
- Approximation algorithms for NP-complete problems on planar graphs
- Title not available (Why is that?)
- A Separator Theorem for Planar Graphs
- Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
- Title not available (Why is that?)
- Bidimensionality: new connections between FPT algorithms and PTASs
- A linear-time algorithm to find a separator in a graph excluding a minor
- Diameter and treewidth in minor-closed graph families
- A separator theorem for graphs of bounded genus
- A Theorem on Planar Graphs
- Planar separators and parallel polygon triangulation.
- Title not available (Why is that?)
- Reduced constants for simple cycle graph separation
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Title not available (Why is that?)
- Polynomial Time Algorithms for Tracking Path Problems
- Tracking Paths
- Title not available (Why is that?)
- Tracking routes in communication networks
- A polynomial sized kernel for tracking paths problem
Cited In (4)
This page was built for publication: How to catch marathon cheaters: new approximation algorithms for tracking paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832889)
