Budgeted out-tree maximization with submodular prizes (Q6602425)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Budgeted out-tree maximization with submodular prizes |
scientific article; zbMATH DE number 7911075
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Budgeted out-tree maximization with submodular prizes |
scientific article; zbMATH DE number 7911075 |
Statements
Budgeted out-tree maximization with submodular prizes (English)
0 references
11 September 2024
0 references
prize collecting Steiner tree
0 references
directed graphs
0 references
approximation algorithms
0 references
budgeted problem
0 references
