A precomputation scheme for minimum interference routing: the least-critical-path-first algorithm.
Gábor RétváriJózsef BíróTibor CinklerTamás HenkPublished in: INFOCOM (2005)
Keyphrases
- critical path
- learning algorithm
- computational complexity
- segmentation algorithm
- polynomial time approximation
- routing problem
- benchmark problems
- detection algorithm
- simulated annealing
- k means
- search space
- dynamic programming
- special case
- particle swarm optimization
- lower bound
- solution quality
- objective function
- job shop scheduling problem
- social networks
- neural network