Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching (Q3967061)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3789846
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching |
scientific article; zbMATH DE number 3789846 |
Statements
Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching (English)
0 references
1983
0 references
graph algorithm
0 references
computational geometry
0 references
