No article text was recorded for this version.
sparse graph optimal transport
Version 1 of 17 papers13 conceptsfrozen 2026-10-04
Papers in this version
- Blog: A Computation-Aware Shape Loss Function for Point Cloud Completion
- Blog: Metric Extension Operators, Vertex Sparsifiers and Lipschitz Extendability
- Blog: Approximating the Held-Karp Bound for Metric TSP in Nearly-Linear Time
- Blog: Ground Metric Learning on Graphs
- Blog: Measuring Sample Quality with Stein's Method
- Blog: Optimal Geo-Indistinguishable Mechanisms for Location Privacy
- Blog: Scalable Facility Location for Massive Graphs on Pregel-like Systems
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_sparse_graph_optimal_transport_58711354,
title = {sparse graph optimal transport},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/sparse-graph-optimal-transport/rdr_5871135454c24ac1a986aac039e42247},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-21},
}This exact version (version 1, frozen text):
@misc{lacuna_sparse_graph_optimal_transport_58711354_v1,
title = {sparse graph optimal transport},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/sparse-graph-optimal-transport/rdr_5871135454c24ac1a986aac039e42247/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-21},
}