Quasi-polynomial algorithms for submodular tree orienteering and directed network design problems (Q5085153)
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: Quasi-polynomial algorithms for submodular tree orienteering and directed network design problems |
scientific article; zbMATH DE number 7548079
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Quasi-polynomial algorithms for submodular tree orienteering and directed network design problems |
scientific article; zbMATH DE number 7548079 |
Statements
Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems (English)
0 references
27 June 2022
0 references
approximation algorithms
0 references
network design
0 references
submodularity
0 references
0 references
0 references
0 references
0 references
0.7925498485565186
0 references
0.7784842848777771
0 references
0.7699560523033142
0 references
