A Direct tilde{O}(1/epsilon) Iteration Parallel Algorithm for Optimal Transport
Arun Jambulapati, Aaron Sidford, Kevin Tian
–Neural Information Processing Systems
We give an algorithm which solves the problem to additiveaccuracy with O(1/) parallel depth and O n2/ work.
Neural Information Processing Systems
Feb-11-2026, 08:01:43 GMT
- Country:
- Oceania > Australia
- New South Wales > Sydney (0.04)
- North America
- United States
- Nevada (0.04)
- Pennsylvania > Philadelphia County
- Philadelphia (0.04)
- Oregon > Multnomah County
- Portland (0.14)
- New York > New York County
- New York City (0.04)
- California
- Alameda County > Berkeley (0.05)
- Santa Clara County > Palo Alto (0.04)
- San Diego County > San Diego (0.04)
- Canada
- Quebec > Montreal (0.04)
- British Columbia > Metro Vancouver Regional District
- Vancouver (0.04)
- United States
- Europe
- Asia
- Middle East > Jordan (0.04)
- South Korea > Seoul
- Seoul (0.04)
- Oceania > Australia
- Technology: