On the Hardness of Network Design for Bottleneck Routing Games
Dimitris FotakisAlexis C. KaporisThanasis LianeasPaul G. SpirakisPublished in: CoRR (2012)
Keyphrases
- network design
- switched networks
- communication networks
- network design problem
- game theory
- heuristic solution
- network architecture
- facility location
- shortest path
- ad hoc networks
- phase transition
- routing algorithm
- video games
- np hard
- network topology
- routing problem
- worst case
- ip networks
- computer games
- databases
- routing protocol
- traffic conditions
- energy consumption
- game playing
- search algorithm
- optimal solution
- internet protocol
- genetic algorithm