A Constant Factor Approximation for Capacitated Min-Max Tree Cover

Syamantak Das, Lavina Jain, Nikhil Kumar

Given a graph $G=(V,E)$ with non-negative real edge lengths and an integer parameter $k$, the Min-Max k-Tree Cover problem seeks to find a set of at most $k$ subtrees of $G$, such…