Probabilistic analysis of divide‐and‐conquer heuristics for minimum weighted euclidean matching (Q3969884): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:33, 6 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Probabilistic analysis of divide‐and‐conquer heuristics for minimum weighted euclidean matching |
scientific article |
Statements
Probabilistic analysis of divide‐and‐conquer heuristics for minimum weighted euclidean matching (English)
0 references
1983
0 references
expected costs of the matchings found by various divide-and-conquer heuristic algorithms
0 references
expected times
0 references
