A near-linear constant-factor approximation for Euclidean bipartite matching? (Q5361677)
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 6783900
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A near-linear constant-factor approximation for Euclidean bipartite matching? |
scientific article; zbMATH DE number 6783900 |
Statements
A near-linear constant-factor approximation for euclidean bipartite matching? (English)
0 references
29 September 2017
0 references
approximation algorithms
0 references
combinatorial optimization
0 references
matching
0 references
0.8444272875785828
0 references
0.836090087890625
0 references
0.8320832848548889
0 references
