Inapproximability and a polynomially solvable special case of a network improvement problem. (Q1428068)
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: Inapproximability and a polynomially solvable special case of a network improvement problem. |
scientific article; zbMATH DE number 2056225
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Inapproximability and a polynomially solvable special case of a network improvement problem. |
scientific article; zbMATH DE number 2056225 |
Statements
Inapproximability and a polynomially solvable special case of a network improvement problem. (English)
0 references
14 March 2004
0 references
Network flows
0 references
Shortest path
0 references
Maximum 3-satisfiability
0 references
Inapproximability
0 references
