A sub-quadratic algorithm for bipartite matching of planar points with bounded integer coordinates (Q5174455)
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: A sub-quadratic algorithm for bipartite matching of planar points with bounded integer coordinates |
scientific article; zbMATH DE number 6405106
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A sub-quadratic algorithm for bipartite matching of planar points with bounded integer coordinates |
scientific article; zbMATH DE number 6405106 |
Statements
A sub-quadratic algorithm for bipartite matching of planar points with bounded integer coordinates (English)
0 references
17 February 2015
0 references
Euclidean bipartite matching
0 references
