Reproduce “Minimum-Cost $k$-Arborescence Packing in $\tilde O(km+k^4 n)$ Time” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Zhaienhe Zhou
The authors present a deterministic algorithm to find a minimum-cost packing of k arc-disjoint spanning arborescences directed outward from a common root. It maintains a minimum-cost set of arcs split among k forests and batches shortest augmenting paths, checking independence on contracted tight blocks. For fixed k, its running time is O(m log n + n log^3 n), an algorithmic bound rather than an empirical speedup.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.