The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals (Q3434998)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals |
scientific article |
Statements
The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals (English)
0 references
3 May 2007
0 references
Steiner tree
0 references
Steiner network
0 references
network design
0 references
directed graphs
0 references
polynomial-time algorithms
0 references
