The Hardness of Selective Network Design for Bottleneck Routing Games.
Haiyang HouGuochuan ZhangPublished in: TAMC (2007)
Keyphrases
- network design
- switched networks
- communication networks
- network design problem
- facility location
- network architecture
- video games
- heuristic solution
- game playing
- computer games
- routing problem
- game theory
- routing algorithm
- computational complexity
- phase transition
- np hard
- data mining
- reverse logistics
- network topology
- integer programming
- ad hoc networks
- worst case
- data model
- objective function
- genetic algorithm