A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms.
Hannah BastKurt MehlhornGuido SchäferPublished in: Algorithmica (2003)
Keyphrases
- times faster
- computational cost
- dynamic programming
- computational complexity
- learning algorithm
- significant improvement
- computationally efficient
- theoretical analysis
- benchmark problems
- combinatorial optimization
- running times
- k means
- greedy algorithms
- matching algorithm
- exhaustive search
- optimal solution
- worst case
- single pass
- greedy search
- computational efficiency
- solution quality
- depth first search
- benchmark instances
- heuristic rules
- randomized algorithm
- classification algorithm
- greedy algorithm
- simulated annealing
- optimization problems
- minimum spanning tree
- approximate solutions
- expectation maximization
- space complexity
- nearest neighbour
- detection algorithm
- stereo correspondence
- beam search
- memory requirements
- np hard
- search algorithm
- particle swarm optimization
- matching process
- ant colony optimization
- search space
- data structure
- objective function