How heavy independent sets help to find arborescences with many leaves in DAGs (Q2698292)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How heavy independent sets help to find arborescences with many leaves in DAGs |
scientific article |
Statements
How heavy independent sets help to find arborescences with many leaves in DAGs (English)
0 references
21 April 2023
0 references
approximation algorithms
0 references
maximum leaf spanning arborescence
0 references
weighted independent sets
0 references
directed acyclic graphs
0 references
0 references
0 references
