How to catch marathon cheaters: new approximation algorithms for tracking paths (Q832889)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: How to catch marathon cheaters: new approximation algorithms for tracking paths |
scientific article; zbMATH DE number 7498695
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | How to catch marathon cheaters: new approximation algorithms for tracking paths |
scientific article; zbMATH DE number 7498695 |
Statements
How to catch marathon cheaters: new approximation algorithms for tracking paths (English)
0 references
25 March 2022
0 references
graph algorithms
0 references
approximation algorithms
0 references
graph minor
0 references
fixed-parameter tractability
0 references
kernelization
0 references
minor-free graphs
0 references
road networks
0 references
