On the Computation of Kantorovich--Wasserstein Distances Between Two-Dimensional Histograms by Uncapacitated Minimum Cost Flows (Q5124004): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: DOTmark / rank | |||
Normal rank | |||
Revision as of 03:43, 29 February 2024
scientific article; zbMATH DE number 7248646
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Computation of Kantorovich--Wasserstein Distances Between Two-Dimensional Histograms by Uncapacitated Minimum Cost Flows |
scientific article; zbMATH DE number 7248646 |
Statements
On the Computation of Kantorovich--Wasserstein Distances Between Two-Dimensional Histograms by Uncapacitated Minimum Cost Flows (English)
0 references
17 September 2020
0 references
Kantorovich metric
0 references
Wasserstein distance
0 references
transportation problem
0 references
network simplex
0 references
uncapacitated minimum cost flow problem
0 references
