On the inapproximability of disjoint paths and minimum Steiner forest with bandwidth constraints (Q1975964)
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: On the inapproximability of disjoint paths and minimum Steiner forest with bandwidth constraints |
scientific article; zbMATH DE number 1441895
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the inapproximability of disjoint paths and minimum Steiner forest with bandwidth constraints |
scientific article; zbMATH DE number 1441895 |
Statements
On the inapproximability of disjoint paths and minimum Steiner forest with bandwidth constraints (English)
0 references
8 May 2000
0 references
network optimization
0 references
0 references
