A minimum separation algorithm for river routing with bounded number of jogs.
Andranik MirzaianPublished in: ICCAD (1989)
Keyphrases
- computational complexity
- dynamic programming
- learning algorithm
- worst case
- computational cost
- execution times
- search space
- significant improvement
- space complexity
- objective function
- experimental evaluation
- single scan
- computational effort
- recognition algorithm
- memory requirements
- times faster
- expectation maximization
- constant factor
- theoretical analysis
- detection algorithm
- optimal solution
- search algorithm
- np hard
- probabilistic model
- routing decisions
- similarity measure
- maximum distance
- randomized algorithm
- initial set
- routing problem
- optimization algorithm
- high accuracy
- simulated annealing
- convex hull
- linear programming
- tree structure
- ant colony optimization
- clustering method
- neural network