A heuristic for Dijkstra's algorithm with many targets and its use in weighted matching algorithms (Q1402219)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A heuristic for Dijkstra's algorithm with many targets and its use in weighted matching algorithms |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A heuristic for Dijkstra's algorithm with many targets and its use in weighted matching algorithms |
scientific article |
Statements
A heuristic for Dijkstra's algorithm with many targets and its use in weighted matching algorithms (English)
0 references
19 August 2003
0 references
Single-source shortest-path problem
0 references
Dijkstra's algorithm
0 references
Weighted bipartite matching problem
0 references
Assignment problem
0 references
