On the Hardness of Network Design for Bottleneck Routing Games.
Dimitris FotakisAlexis C. KaporisThanasis LianeasPaul G. SpirakisPublished in: SAGT (2012)
Keyphrases
- network design
- switched networks
- communication networks
- network architecture
- video games
- computational complexity
- heuristic solution
- network design problem
- facility location
- game theory
- computer games
- routing algorithm
- np hard
- phase transition
- network topology
- ad hoc networks
- routing problem
- game playing
- routing protocol
- decision support
- information systems
- data analysis
- traffic conditions
- shortest path
- worst case