An \(O(n^2)\) algorithm for the limited-capacity many-to-many point matching in one dimension (Q329283)
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: An O(n^2) algorithm for the limited-capacity many-to-many point matching in one dimension |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(O(n^2)\) algorithm for the limited-capacity many-to-many point matching in one dimension |
scientific article |
Statements
An \(O(n^2)\) algorithm for the limited-capacity many-to-many point matching in one dimension (English)
0 references
21 October 2016
0 references
many-to-many point matching
0 references
one-dimensional point-matching
0 references
limited-capacity point matching
0 references
0 references
0.8417449593544006
0 references
0.729616105556488
0 references
0.7271693348884583
0 references
0.7257863879203796
0 references
0.7248675227165222
0 references
