Login / Signup
The 2-3-Set Packing problem and a 3/4-approximation for the Maximum Leaf Spanning Arborescence problem in rooted dags.
Meike Neuwohner
Published in:
CoRR (2023)
Keyphrases
</>
packing problem
approximation methods
high dimensional
maximum number
arbitrary shaped