An algorithm for finding a non-trivial lower bound for channel routing1.
Rajat Kumar PalSudebkumar Prasant PalAjit PalPublished in: Integr. (1998)
Keyphrases
- lower bound
- objective function
- optimal solution
- upper bound
- worst case
- k means
- detection algorithm
- dynamic programming
- learning algorithm
- times faster
- cost function
- randomized algorithm
- matching algorithm
- recognition algorithm
- theoretical analysis
- computational cost
- np hard
- search space
- routing problem
- estimation algorithm
- average case
- simulated annealing
- knapsack problem
- convergence rate
- combinatorial optimization
- shortest path
- optimization algorithm
- motion estimation
- computational complexity
- similarity measure