Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching (Q3967061): 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.1137/0212008 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2055674322 / rank | |||
Normal rank | |||
Latest revision as of 19:05, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching |
scientific article |
Statements
Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching (English)
0 references
1983
0 references
graph algorithm
0 references
computational geometry
0 references
