Wireless Localization with Vertex Guards is NP-hard.
Tobias ChristMichael HoffmannPublished in: CCCG (2009)
Keyphrases
- np hard
- approximation algorithms
- wireless communication
- wireless networks
- optimal solution
- computational complexity
- linear programming
- np complete
- minimum cost
- received signal strength
- greedy heuristic
- mobile communication
- object localization
- special case
- localization algorithm
- undirected graph
- minimum weight
- integer programming
- scheduling problem
- worst case
- signal strength
- closely related
- mobile devices
- mobile networks
- wireless channels
- directed graph
- remains np hard
- lower bound
- approximation ratio
- np hardness
- internet access
- cellular networks
- multi hop
- wifi
- mobile ad hoc networks
- constraint satisfaction problems
- mobile users
- context aware
- mobile phone
- decision problems
- communication networks