Algorithms for 2-connected network design and flexible Steiner trees with a constant number of terminals (Q6663024)
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 7966923
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for 2-connected network design and flexible Steiner trees with a constant number of terminals |
scientific article; zbMATH DE number 7966923 |
Statements
Algorithms for 2-connected network design and flexible Steiner trees with a constant number of terminals (English)
0 references
14 January 2025
0 references
approximation algorithms
0 references
capacitated network design
0 references
network design
0 references
parametrized algorithms
0 references
Steiner cycle problem
0 references
Steiner 2-edge connected subgraphs
0 references
Steiner 2-node connected subgraphs
0 references
