A core optimization problem that has dogged computer science for decades just reached almost-linear speeds across every test case.
April 25, 2026
Original Paper
Blossom VI: A Practical Minimum Weight Perfect Matching Algorithm
arXiv · 2604.20351
The Takeaway
Minimum weight perfect matching is a fundamental bottleneck for everything from logistics to quantum error correction. The new Blossom VI implementation consistently outperforms the previous gold standard by moving the runtime into a nearly linear category. Engineers previously had to settle for slower results or approximate solutions when dealing with massive datasets. This speedup means real-world scheduling and matching tasks that used to take hours can now be completed in seconds. It provides a massive efficiency boost for the infrastructure that powers global delivery networks and communication systems.
From the abstract
We implement an algorithm for solving the minimum weight perfect matching problem. Our code significantly outperforms the current state-of-the-art Blossom V algorithm on those families of instances where Blossom V takes superlinear time. In practice, our implementation shows almost-linear runtime on every family of instances on which we have tested it.Our algorithm relies on solving the maximum-cardinality unweighted matching problems during its primal phase. Following the state-of-the-art cherr