Probabilistic analysis of divide‐and‐conquer heuristics for minimum weighted euclidean matching (Q3969884)
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: Probabilistic analysis of divide‐and‐conquer heuristics for minimum weighted euclidean matching |
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
