A $\nicefrac {4}{3}$-approximation for the maximum leaf spanning arborescence problem in DAGs

Meike Neuwohner. A $\nicefrac {4}{3}$-approximation for the maximum leaf spanning arborescence problem in DAGs. Math. Program., 216(1):111-133, March 2026. [doi]

Abstract

Abstract is missing.