{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:33:47Z","timestamp":1725564827235},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540222309"},{"type":"electronic","value":"9783540277965"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27796-5_24","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T21:47:42Z","timestamp":1283723262000},"page":"267-278","source":"Crossref","is-referenced-by-count":2,"title":["NP-Completeness Results for All-Shortest-Path Interval Routing"],"prefix":"10.1007","author":[{"given":"Rui","family":"Wang","sequence":"first","affiliation":[]},{"given":"Francis C. M.","family":"Lau","sequence":"additional","affiliation":[]},{"given":"Yan Yan","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Booth, K.S., Lueker, S.: Linear algorithm to recognize interval graphs and test for consecutive ones property. In: Proc. 7th Ann. ACM Symp. on Theory of Computing, New York, pp. 255\u2013265 (1975)","DOI":"10.1145\/800116.803776"},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/S0304-3975(01)00180-3","volume":"289","author":"T. Eilam","year":"2002","unstructured":"Eilam, T., Moran, S., Zaks, S.: The complexity of the characterization of networks supporting shortest-path interval routing. Theoretical Computer Science\u00a0289, 85\u2013104 (2002); Also in 4th Internat. Coll. on Structural Information & Communication Complexity (SIROCCO 1997), July 1997, pp. 99\u2013111. Carleton Scientific (1997)","journal-title":"Theoretical Computer Science"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1142\/S0129626497000061","volume":"7","author":"M. Flammini","year":"1997","unstructured":"Flammini, M.: On the hardness of devising interval routing schemes. Parallel Processing Lett.\u00a07, 39\u201347 (1997)","journal-title":"Parallel Processing Lett."},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","volume-title":"STACS 95","year":"1995","unstructured":"Flammini, M., Gambosi, G., Salomone, S.: Interval routing schemes, Algorithmica\u00a016, 549\u2013568 (1996); Mayr, E.W., Puech, C. (eds.): STACS 1995. LNCS, vol.\u00a0900. Springer, Heidelberg (1995)"},{"issue":"4","key":"24_CR5","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1002\/net.1017","volume":"37","author":"M. Flammini","year":"2001","unstructured":"Flammini, M., Nanni, U., Tan, R.B.: Characterization results of all-shortest paths interval routing schemes. Networks\u00a037(4), 225\u2013232 (2001); Also in 5th Internat. Coll. on Structural Information & Communication Complexity (SIROCCO 1998), pp. 201\u2013213 (1998)","journal-title":"Networks"},{"key":"24_CR6","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Jonson, D.S.: Computers and intractability: A guide to the theory of NP-completeness. Freeman, San Francisco (1979)"},{"issue":"2","key":"24_CR7","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/S0304-3975(99)00283-2","volume":"245","author":"C. Gavoille","year":"2000","unstructured":"Gavoille, C.: A survey on interval routing. Theoretical Computer Science\u00a0245(2), 217\u2013253 (2000)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"24_CR8","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1089\/cmb.1995.2.139","volume":"2","author":"P.W. Goldberg","year":"1995","unstructured":"Goldberg, P.W., Glumbic, M.C., Kaplan, H., Shamir, R.: Four strikes against physical mapping of DNA. Journal of Computational Biology\u00a02(1), 139\u2013152 (1995)","journal-title":"Journal of Computational Biology"},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1093\/comjnl\/28.1.5","volume":"28","author":"N. Santoro","year":"1985","unstructured":"Santoro, N., Khatib, R.: Labeling and implicit routing in networks. Comput. J.\u00a028, 5\u20138 (1985)","journal-title":"Comput. J."},{"key":"24_CR10","series-title":"The Book of L","first-page":"298","volume-title":"Computer networks with compact routing tables","author":"J. Leeuwen van","year":"1985","unstructured":"van Leeuwen, J., Tan, R.B.: Computer networks with compact routing tables. The Book of L, pp. 298\u2013307. Springer, Berlin (1985)"},{"key":"24_CR11","unstructured":"Wang, R., Lau, F.C.M.: Consecutive ones block for symmetric matrices, Technical Report TR-2003-09, Department of CSIS, The University of Hong Kong (2003), \n                  \n                    www.csis.hku.hk\/research\/techreps\/document\/TR-2003-09.pdf"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27796-5_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:26:14Z","timestamp":1620012374000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27796-5_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540222309","9783540277965"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27796-5_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}