research
∙
05/13/2023
The 2-3-Set Packing problem and a 4/3-approximation for the Maximum Leaf Spanning Arborescence problem in rooted dags
The weighted 3-Set Packing problem is defined as follows: As input, we a...
share
research
∙
06/07/2021
