How to Catch Marathon Cheaters: New Approximation Algorithms for Tracking Paths.
Michael T. GoodrichSiddharth GuptaHadi KhodabandehPedro MatiasPublished in: CoRR (2021)
Keyphrases
- approximation algorithms
- disjoint paths
- np hard
- special case
- vertex cover
- minimum cost
- facility location problem
- worst case
- primal dual
- network design problem
- exact algorithms
- approximation schemes
- set cover
- approximation ratio
- undirected graph
- constant factor
- open shop
- precedence constraints
- np hardness
- combinatorial auctions
- randomized algorithms
- particle filter
- genetic algorithm
- polynomial time approximation
- linear program
- search algorithm