A Simple DFS-Based Algorithm for Linear Interval Routing.
Tamar EilamShlomo MoranShmuel ZaksPublished in: WDAG (1997)
Keyphrases
- learning algorithm
- times faster
- detection algorithm
- dynamic programming
- preprocessing
- optimization algorithm
- k means
- linear systems
- ant algorithm
- linear complexity
- worst case
- np hard
- combinatorial optimization
- closed form
- theoretical analysis
- experimental evaluation
- search space
- depth first search
- computational complexity
- integer arithmetic
- linear programming
- shortest path problem
- improved algorithm
- linear space
- recognition algorithm
- matching algorithm
- cost function
- significant improvement
- association rules
- optimal solution
- bayesian networks
- similarity measure
- feature selection