A heuristic for Dijkstra's algorithm with many targets and its use in weighted matching algorithms (Q1402219): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00453-002-1008-z / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1486649110 / rank | |||
Normal rank | |||
Latest revision as of 23:55, 19 March 2024
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
