An algorithm to solve them ×n assignment problem in expected timeO(mn logn) (Q3883530): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.3230100205 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1993343369 / rank | |||
Normal rank | |||
Revision as of 23:54, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm to solve them ×n assignment problem in expected timeO(mn logn) |
scientific article |
Statements
An algorithm to solve them ×n assignment problem in expected timeO(mn logn) (English)
0 references
1980
0 references
assignment problem
0 references
edge costs
0 references
priority queues
0 references
