Inapproximability and a polynomially solvable special case of a network improvement problem. (Q1428068)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Inapproximability and a polynomially solvable special case of a network improvement problem. |
scientific article |
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
