Polynomial-time approximation algorithms for anchor-free TDoA localization.
Johannes WendebergChristian SchindelhauerPublished in: Theor. Comput. Sci. (2014)
Keyphrases
- approximation algorithms
- special case
- approximation ratio
- worst case
- np hard
- location estimation
- minimum cost
- vertex cover
- constant factor
- network design problem
- np hardness
- approximation guarantees
- facility location problem
- primal dual
- open shop
- set cover
- precedence constraints
- randomized algorithms
- greedy algorithm
- polynomial time approximation
- approximation schemes
- linear programming
- dynamic programming
- disjoint paths
- computational complexity