Preprint
Aug 2026
Designing Caterpillars for Graphs: Approximation and Hardness
An algorithm is given that lifts any $\alpha$-approximation for MLA to an $(\alpha+3-2/(\Delta-1))-approximation for the problem, thus obtaining an $O(\sqrt{\log n}\log\log n)-approximation for the more general problem as well.
L. Kullmann, Phuoc Trinh, Leon Kellerhals et al.
· 0 citations