Research map / Learning theory and algorithms / Optimal transport
Theory and Approximate Solvers for Branched Optimal Transport with Multiple Sources
Peter Lippmann, Enrique Fita Sanmartín, Fred A Hamprecht
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use greedy zero-temperature topology heuristic instead of brute-force enumeration of full tree topologies | BOT solver · BOT with up to nine terminals | cost relative to exact solution: less than 0.5% worse | Mixed |
| use greedy heuristic instead of brute force at n=9 | BOT solver · BOT n=9 | number of branching point optimizations: over 10^5 -> 29 +- 10 | Improved |
| increase number of terminals n | greedy heuristic · BOT cost ratio vs brute force | cost ratio | No clear effect |
Closest papers by meaning
- A Combinatorial Algorithm for the Semi-Discrete Optimal Transport Problem (NeurIPS 2024 · similarity 0.86)
- A Truncated Newton Method for Optimal Transport (ICLR 2025 · similarity 0.84)
- Generalized Sobolev Transport for Probability Measures on a Graph (ICML 2024 · similarity 0.84)
- Optimal Transport with Cyclic Symmetry (AAAI 2024 · similarity 0.84)
- Computing Optimal Transport Maps and Wasserstein Barycenters Using Conditional Normalizing Flows (ICML 2025 · similarity 0.84)
- Bisimulation Metrics are Optimal Transport Distances, and Can be Computed Efficiently (NeurIPS 2024 · similarity 0.84)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
