Abstract
k-Interval Routing Scheme (k-IRS) is a compact routing method that allows up to k interval labels to be assigned to an arc. A fundamental problem is to characterize the networks that admit k-IRS. All of the problems related to single-shortest-path k-IRS have already been shown to be NP-complete. For all-shortest-path k-IRS, the characterization problems have been proved to be NP-complete for every k≥3, and remain open for k=1,2. In this paper, we close the open case of k=2 by showing that it is NP-complete to decide whether a graph admits an all-shortest-path 2-IRS. The same proof is also valid for all-shortest-path Strict 2-IRS. All-shortest-path Strict k-IRS is previously known to be polynomial for k=1, open for k=2,3, and NP-complete for every constant k≥4.
Similar content being viewed by others
References
Bakker, E.M., van Leeuwen, J., Tan, R.B.: Linear interval routing. Algorithms Rev. 2, 45–61 (1991)
Booth, K.S., Lueker, S.: Linear algorithm to recognize interval graphs and test for consecutive ones property. In: Proc. of the 7th Ann. ACM Symp. on Theory of Computing, New York, pp. 255–265 (1975)
Eilam, T., Moran, S., Zaks, S.: The complexity of the characterization of networks supporting shortest-path interval routing. Theor. Comput. Sci. 289, 85–104 (2002) (Also In: 4th Int. Coll. on Structural Information and Communication Complexity (SIROCCO), pp. 99–111, July 1997. Carleton Scientific.)
Flammini, M.: On the hardness of devising interval routing schemes. Parallel Proces. Lett. 7, 39–47 (1997)
Flammini, M., Gambosi, G., Salomone, S.: Interval routing schemes. Algorithmica 16, 549–568 (1996) (Also In: 12th Ann. Symp. on Theoretical Aspects of Computer Science (STACS), March 1995. Lecture Notes in Computer Science, vol. 900, pp. 279–290. Springer, Berlin.)
Flammini, M., Nanni, U., Tan, R.B.: Characterization results of all-shortest paths interval routing schemes. Networks 37(4), 225–232 (2001) (Also In: 5th Internat. Coll. on Structural Information and Communication Complexity (SIROCCO), 1998, pp. 201–213.)
Fraigniaud, P., Gavoille, C.: A characterization of networks supporting linear interval routing. In: Proc. of the 13th ACM Symp. on Principles of Distributed Computing, pp. 216–224 (1994)
Garey, M.R., Johnson, D.S., Tarjan, R.E.: The planar Hamiltonian circuit is NP-complete. SIAM J. Comput 5, 704–714 (1976)
Gavoille, C.: A survey on interval routing. Theor. Comput. Sci. 245(2), 217–253 (2000)
Gavoille, C., Zemmari, A.: The compactness of adaptive routing tables. J. Discrete Algorithms 1(2), 237–254 (2003)
Goldberg, P.W., Glumbic, M.C., Kaplan, H., Shamir, R.: Four strikes against physical mapping of DNA. J. Comput. Biol. 2(1), 139–152 (1995)
Kranakis, E., Krizanc, D., Ravi, S.: On multi-label linear interval routing schemes. In: Workshop on Graph-Theoretic Concepts in Computer Science (WG). Lecture Notes in Computer Science, vol. 790, pp. 338–349. Springer, Berlin (1993)
Narayanan, L., Shende, S.: Characterization of networks supporting shortest path interval routing schemes. In: 3rd Internat. Coll. on Structural Information and Communication Complexity (SIROCCO), pp. 73–87. Carleton University Press, Carleton (1996)
Santoro, N., Khatib, R.: Labeling and implicit routing in networks. Comput. J. 28, 5–8 (1985)
Van Leeuwen, J., Tan, R.B.: Computer networks with compact routing tables. In: The Book of L, pp. 259–273. Springer, Berlin (1986)
Van Leeuwen, J., Tan, R.B.: Interval routing. Comput. J. 30, 298–307 (1987)
Wang, R., Lau, F.C.M.: Consecutive ones blocks for symmetric matrices. Technical report TR-2003-09, Department of CSIS, The University of Hong Kong (2003) (www.csis.hku.hk/research/techreps/document/TR-2003-09.pdf)
Wang, R., Lau, F.C.M.: Hamiltonicity of regular graphs and blocks of consecutive ones in symmetric matrices. Discrete Appl. Math. 155, 2312–2320 (2007)
Wang, R., Lau, F.C.M., Liu, Y.Y.: NP-completeness results for all-shortest paths interval routing. In: 11th Internat. Coll. on Structural Information and Communication Complexity (SIROCCO). Lecture Notes in Computer Science, vol. 3104, pp. 267–278. Springer, Berlin (2004)
Author information
Authors and Affiliations
Corresponding author
Additional information
The research work of K. Wang was funded by the U.S. National Science Foundation under grant ASC070018T, by the U.S. South Dakota Governor’s Individual Research Seed Grant Award, by the South Dakota Brin Program of NIH/NCRR, and by the China National Science Foundation under grants 60673151 and 60403036.
The research work of R. Wang and Y. Liu was funded by the China National Science Foundation under grants 60673151 and 60403036.
Rights and permissions
About this article
Cite this article
Wang, K., Wang, R. & Liu, Y. All-shortest-path 2-interval routing is NP-complete. J. Appl. Math. Comput. 32, 479–489 (2010). https://doi.org/10.1007/s12190-009-0265-2
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12190-009-0265-2