Polarized routing: an efficient and versatile algorithm for large direct networks.
Cristóbal CamareroCarmen MartínezRamón BeividePublished in: HOTI (2021)
Keyphrases
- np hard
- experimental evaluation
- improved algorithm
- times faster
- detection algorithm
- preprocessing
- worst case
- simulated annealing
- optimal solution
- high accuracy
- cost function
- dynamic programming
- computationally efficient
- particle swarm optimization
- learning algorithm
- segmentation algorithm
- optimization algorithm
- routing problem
- k means
- search space
- computational complexity
- objective function
- similarity measure
- neural network
- linear programming
- mobile robot
- expectation maximization
- significant improvement
- theoretical analysis
- matching algorithm
- recognition algorithm
- multicast routing