Efficient algorithms for geometric partial matching (Q5088931)
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 7559206
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms for geometric partial matching |
scientific article; zbMATH DE number 7559206 |
Statements
18 July 2022
0 references
partial matching
0 references
transportation
0 references
optimal transport
0 references
minimum-cost flow
0 references
bichromatic closest pair
0 references
0 references
0 references
0.8604695796966553
0 references
0.834812581539154
0 references
0.8290075659751892
0 references
0.8244373798370361
0 references
0.8229062557220459
0 references
