Reproduce “Min cost flow on unit capacity networks and convex cost K-flow are as easy as the assignment problem with All-Min-Cuts algorithm” on OpenResearch

Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.