AI Paper Atlas

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

NeurIPS 2022 · Learning theory and algorithms › Optimal transport · approach: Sinkhorn and entropic OT algorithms · 0 citations (OpenAlex)

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 changedWhereMeasuredEffect
use greedy zero-temperature topology heuristic instead of brute-force enumeration of full tree topologiesBOT solver · BOT with up to nine terminalscost relative to exact solution: less than 0.5% worseMixed
use greedy heuristic instead of brute force at n=9BOT solver · BOT n=9number of branching point optimizations: over 10^5 -> 29 +- 10Improved
increase number of terminals ngreedy heuristic · BOT cost ratio vs brute forcecost ratioNo clear effect

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy