An algorithm to solve them ×n assignment problem in expected timeO(mn logn) (Q3883530): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / author | |||
| Property / author: Richard M. Karp / rank | |||
| Property / author | |||
| Property / author: Richard M. Karp / rank | |||
Normal rank | |||
| 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.1002/net.3230100205 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1993343369 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3048571 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 05:50, 13 June 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
