Hardness and approximation of Gathering in static radio networks.
Jean-Claude BermondNelson MoralesStéphane PérennesJérôme GaltierRalf KlasingPublished in: PerCom Workshops (2006)
Keyphrases
- agnostic learning
- error bounds
- learning theory
- social networks
- worst case
- real time
- approximation error
- complex networks
- computer networks
- network design
- approximation schemes
- information gathering
- small world
- cellular networks
- network analysis
- phase transition
- approximation algorithms
- closed form
- network structure
- information theoretic
- np hard
- computational complexity
- genetic algorithm