Probabilistic analysis of divide‐and‐conquer heuristics for minimum weighted euclidean matching (Q3969884): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.3230130104 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2167937495 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs / rank | |||
Normal rank | |||
Revision as of 16:50, 13 June 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
