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. In Jens Vygen, Jaroslaw Byrka, editors, Integer Programming and Combinatorial Optimization - 25th International Conference, IPCO 2024, Wrocław, Poland, July 3-5, 2024, Proceedings. Volume 14679 of Lecture Notes in Computer Science, pages 337-350, Springer, 2024. [doi]

Abstract

Abstract is missing.