Adaptive and Oblivious Algorithms for D-Cube Permutation Routing.
Miltos D. GrammatikakisD. Frank HsuFrank K. HwangPublished in: ISAAC (1993)
Keyphrases
- benchmark datasets
- computationally efficient
- theoretical analysis
- adaptive algorithms
- computational complexity
- combinatorial optimization
- multi dimensional
- optimization problems
- times faster
- computational efficiency
- shortest path
- benchmark problems
- computationally expensive
- data mining algorithms
- orders of magnitude
- learning algorithm
- worst case
- face recognition
- social networks