Hardness of Routing for Minimizing Superlinear Polynomial Cost in Directed Graphs (Q2988851)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hardness of Routing for Minimizing Superlinear Polynomial Cost in Directed Graphs |
scientific article |
Statements
Hardness of Routing for Minimizing Superlinear Polynomial Cost in Directed Graphs (English)
0 references
19 May 2017
0 references
hardness of approximation
0 references
superlinear polynomial cost
0 references
directed graphs
0 references
network energy efficiency
0 references
0 references
