All-shortest-path 2-interval routing is NP-complete (Q2380872)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5692043
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | All-shortest-path 2-interval routing is NP-complete |
scientific article; zbMATH DE number 5692043 |
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
0.95592254
0 references
0.87389094
0 references
0.87220955
0 references
0.86771137
0 references
0.85675484
0 references
0.8564984
0 references
0.8540795
0 references
0.85068774
0 references
