NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow (Q2464420)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow |
scientific article |
Statements
NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow (English)
0 references
20 December 2007
0 references
