A \(\frac{4}{3}\)-approximation for the maximum leaf spanning arborescence problem in DAGs (Q7239184)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8196946
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A \(\frac{4}{3}\)-approximation for the maximum leaf spanning arborescence problem in DAGs |
scientific article; zbMATH DE number 8196946 |
Statements
A \(\frac{4}{3}\)-approximation for the maximum leaf spanning arborescence problem in DAGs (English)
0 references
8 May 2026
0 references
maximum leaf spanning arborescence problem
0 references
weighted set packing
0 references
hereditary set packing
0 references
local search
0 references
0 references
