Solving the Euclidean bottleneck matching problem by \(k\)-relative neighborhood graphs (Q1194341)
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: Solving the Euclidean bottleneck matching problem by k-relative neighborhood graphs |
scientific article; zbMATH DE number 64256
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the Euclidean bottleneck matching problem by \(k\)-relative neighborhood graphs |
scientific article; zbMATH DE number 64256 |
Statements
Solving the Euclidean bottleneck matching problem by \(k\)-relative neighborhood graphs (English)
0 references
27 September 1992
0 references
bottleneck optimization problem
0 references
Euclidean bottleneck matching problem
0 references
relative neighborhood graphs
0 references
0.819068431854248
0 references
0.8159221410751343
0 references
0.8139394521713257
0 references
0.8136351108551025
0 references
0.813115119934082
0 references
