All-shortest-path 2-interval routing is NP-complete (Q2380872)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | All-shortest-path 2-interval routing is NP-complete |
scientific article |
Statements
All-shortest-path 2-interval routing is NP-complete (English)
0 references
12 April 2010
0 references
interval routing schemes
0 references
compact routing
0 references
NP-completeness
0 references
0 references
