On the hardness of network design for bottleneck routing games.
Dimitris FotakisAlexis C. KaporisThanasis LianeasPaul G. SpirakisPublished in: Theor. Comput. Sci. (2014)
Keyphrases
- network design
- switched networks
- communication networks
- network design problem
- game playing
- video games
- network architecture
- computational complexity
- heuristic solution
- facility location
- routing problem
- game theory
- computer games
- routing algorithm
- reverse logistics
- ip networks
- phase transition
- network topology
- ad hoc networks
- routing protocol
- shortest path
- worst case
- upper bound
- np hard
- artificial neural networks
- genetic algorithm
- neural network