A 1.6 Approximation Algorithm for Routing Multiterminal Nets.
Teofilo F. GonzalezSing-Ling LeePublished in: SIAM J. Comput. (1987)
Keyphrases
- computational complexity
- learning algorithm
- theoretical analysis
- dynamic programming
- times faster
- error bounds
- improved algorithm
- high accuracy
- computational cost
- experimental evaluation
- np hard
- significant improvement
- cost function
- expectation maximization
- objective function
- neural network
- matching algorithm
- closed form
- approximation methods
- polygonal approximation
- optimization algorithm
- computationally efficient
- particle swarm optimization
- similarity measure