Skip to content

Author

M. Krebs

We have 1 of 16 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

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

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.