Minimum-Cost k-Arborescence Packing in O(km+k 4 n) Time
cs.DS
Submitted: 2026-11-05
Updated: 2026-11-05
Terminology
Sources
- Faster algorithms for packing forests in graphs and related problems
- Deterministic Negative-Weight Shortest Paths in Nearly Linear Time via Path Covers
- Bellman-Ford in Almost-Linear Time
- On Basic Operations Related to Network Induction of Discrete Convex Functions
- A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow
Related papers
- Exploiting Low Scanwidth to Resolve Soft Polytomies
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time