Set-Cover Approximation Algorithms for Load-Aware Readers Placement in RFID Networks.
Kashif AliWaleed AlsalihHossam S. HassaneinPublished in: ICC (2011)
Keyphrases
- set cover
- approximation algorithms
- greedy heuristics
- np hard
- special case
- vertex cover
- worst case
- minimum cost
- greedy algorithm
- approximation ratio
- primal dual
- randomized algorithms
- network structure
- social networks
- constant factor
- network flow
- precedence constraints
- open shop
- complex networks
- rfid tags
- network design
- approximation guarantees
- polynomial time approximation
- computational complexity
- supply chain
- objective function