Showing results 1 to 2 of 2
| Title | Author(s) | Issue Date | |
|---|---|---|---|
NP-completeness results for all-shortest-path interval routing Journal:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2004 | ||
On the hardness of minimizing space for all-shortest-path interval routing schemes Journal:Theoretical Computer Science | 2007 |