NP-Completeness and an Approximation Algorithm for Rectangle Escape Problem With Application to PCB Routing.
Qiang MaMartin D. F. WongPublished in: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. (2012)
Keyphrases
- optimization algorithm
- worst case
- computational complexity
- k means
- detection algorithm
- np hard
- approximation ratio
- objective function
- improved algorithm
- dynamic programming
- convergence rate
- times faster
- high accuracy
- matching algorithm
- theoretical analysis
- particle swarm optimization
- simulated annealing
- learning algorithm
- experimental evaluation
- cost function
- preprocessing
- optimal solution
- similarity measure
- linear programming
- computational cost
- segmentation algorithm
- tree structure
- significant improvement
- search algorithm
- recognition algorithm