A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms.
Kurt MehlhornGuido SchäferPublished in: ESA (2001)
Keyphrases
- times faster
- dynamic programming
- learning algorithm
- computational cost
- computationally efficient
- running times
- computational complexity
- solution quality
- optimal solution
- worst case
- matching algorithm
- combinatorial optimization
- significant improvement
- benchmark problems
- single pass
- exact algorithms
- simulated annealing
- theoretical analysis
- convergence rate
- exhaustive search
- computational efficiency
- nearest neighbour
- space complexity
- hill climbing
- greedy algorithms
- depth first search
- image matching
- classification algorithm
- search space
- detection algorithm
- memory requirements
- greedy heuristic
- synthetic datasets
- knapsack problem
- maximum weight
- packing problem
- heuristic rules
- np hard
- optimization problems
- approximate solutions
- heuristic methods
- dantzig wolfe
- matching process
- finding an optimal solution
- randomized algorithm
- closest string
- real time search algorithms
- greedy search
- beam search
- moving target
- pattern matching
- expectation maximization
- objective function