Parameterized Approximation Algorithms for Bidirected Steiner Network Problems (Q5032020)
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 7475091
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized Approximation Algorithms for Bidirected Steiner Network Problems |
scientific article; zbMATH DE number 7475091 |
Statements
Parameterized Approximation Algorithms for Bidirected Steiner Network Problems (English)
0 references
16 February 2022
0 references
directed Steiner network
0 references
bidirected graphs
0 references
parameterized approximations
0 references
planar graphs
0 references
strongly connected Steiner subgraph
0 references
0.9868607521057128
0 references
0.7958136200904846
0 references
0.7793270945549011
0 references
0.7785429954528809
0 references
