Some polynomially solvable subcases of the detailed routing problem in VLSI design.
András RecskiPublished in: Discret. Appl. Math. (2001)
Keyphrases
- routing problem
- vlsi design
- polynomially solvable
- np complete
- np hard
- special case
- vehicle routing problem
- processing times
- minimum cost
- design methodology
- routing algorithm
- shortest path
- multicommodity flow
- feasible solution
- travel time
- global optimization
- approximation algorithms
- traveling salesman problem
- optimal solution
- tabu search
- simulated annealing
- qos multicast routing