An Algorithm for Finding a Non-Trivial Lower Bound for Channel Routing.
Rajat Kumar PalSudebkumar Prasant PalAjit PalPublished in: VLSI Design (1997)
Keyphrases
- worst case
- lower bound
- preprocessing
- dynamic programming
- np hard
- detection algorithm
- optimization algorithm
- objective function
- optimal solution
- times faster
- k means
- matching algorithm
- cost function
- computational complexity
- convergence rate
- similarity measure
- branch and bound algorithm
- recognition algorithm
- lower and upper bounds
- theoretical analysis
- particle swarm optimization
- computational cost
- significant improvement
- learning algorithm
- linear programming
- search space
- knapsack problem
- data structure
- estimation algorithm
- memory efficient
- competitive ratio