An efficient algorithm for finding a path subject to two additive constraints.
Turgay KorkmazMarwan KrunzSpyros TragoudasPublished in: SIGMETRICS (2000)
Keyphrases
- computationally efficient
- cost function
- high accuracy
- worst case
- np hard
- multiple constraints
- times faster
- experimental evaluation
- preprocessing
- dynamic programming
- computational complexity
- computational cost
- objective function
- highly efficient
- improved algorithm
- learning algorithm
- path planning
- detection algorithm
- optimization algorithm
- data sets
- significant improvement
- space complexity
- theoretical analysis
- decision trees
- graph cuts
- expectation maximization
- input data
- optimal solution
- semi supervised