A [Formula: see text] -approximation for the maximum leaf spanning arborescence problem in DAGs
{{output}}
The Maximum Leaf Spanning Arborescence problem (MLSA) in directed acyclic graphs (dags) is defined as follows: Given a directed acyclic graph G and a vertex r ∈ V ( G ) from which every other vertex is reachable, find a spanning arborescence rooted at r... ...
