On the inapproximability of disjoint paths and minimum Steiner forest with bandwidth constraints (Q1975964): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:39, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the inapproximability of disjoint paths and minimum Steiner forest with bandwidth constraints |
scientific article |
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
