{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:37:05Z","timestamp":1725568625229},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642169571"},{"type":"electronic","value":"9783642169588"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16958-8_37","type":"book-chapter","created":{"date-parts":[[2010,11,2]],"date-time":"2010-11-02T12:26:12Z","timestamp":1288700772000},"page":"398-409","source":"Crossref","is-referenced-by-count":0,"title":["Subgraphs Generating Algorithm for Obtaining Set of Node-Disjoint Paths in Terrain-Based Mesh Graphs"],"prefix":"10.1007","author":[{"given":"Zbigniew","family":"Tarapata","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Wroclawski","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"37_CR1","doi-asserted-by":"publisher","first-page":"1321","DOI":"10.1137\/S0097539796312733","volume":"29","author":"A. Aggarwal","year":"2000","unstructured":"Aggarwal, A., Kleinberg, J., Williamson, D.: Node-Disjoint Paths on the Mesh and a New Trade-Off in VLSI Layout. SIAM Journal on Computing\u00a029(4), 1321\u20131333 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"37_CR2","doi-asserted-by":"crossref","unstructured":"Andersen, R., Chung, F., Sen, A., Xue, G.: On Disjoint Path Pairs with Wavelength Continuity Constraint in WDM Networks. In: Proceedings of the IEEE INFOCOM 2004, Hong Kong (China), March 7-11, pp. 524\u2013535 (2004)","DOI":"10.1109\/INFCOM.2004.1354524"},{"key":"37_CR3","unstructured":"Eppstein, D.: Finding common ancestors and disjoint paths in DAGs, Technical Report 95-52, Department of Information and Comp. Science, Univ. of California, Irvine (1995)"},{"issue":"2","key":"37_CR4","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1137\/S0097539795290477","volume":"28","author":"D. Eppstein","year":"1999","unstructured":"Eppstein, D.: Finding the K shortest Paths. SIAM J. Computing\u00a028(2), 652\u2013673 (1999)","journal-title":"SIAM J. Computing"},{"key":"37_CR5","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1137\/0205048","volume":"5","author":"S. Even","year":"1976","unstructured":"Even, S., Itai, A., Shamir, A.: On the complexity of time-table and multicommodity flow problems. SIAM Journal on Computing\u00a05, 691\u2013703 (1976)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"37_CR6","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1137\/1015031","volume":"15","author":"T. Ibaraki","year":"1973","unstructured":"Ibaraki, T.: Algorithms for obtaining shortest paths visiting specified nodes. SIAM Review\u00a015(2), Part 1, 309\u2013317 (1973)","journal-title":"SIAM Review"},{"key":"37_CR7","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1287\/opre.47.1.81","volume":"47","author":"A. Jongh","year":"1999","unstructured":"Jongh, A., Gendreau, M., Labbe, M.: Finding disjoint routes in telecommunications networks with two technologies. Operations Research\u00a047, 81\u201392 (1999)","journal-title":"Operations Research"},{"key":"37_CR8","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0166-218X(90)90024-7","volume":"26","author":"C.L. Li","year":"1990","unstructured":"Li, C.L., McCormick, S.T., Simchi-Levi, D.: The complexity of finding two disjoint paths with min-max objective function. Discrete Applied Math.\u00a026, 105\u2013115 (1990)","journal-title":"Discrete Applied Math."},{"key":"37_CR9","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1002\/net.3230220705","volume":"22","author":"C.L. Li","year":"1992","unstructured":"Li, C.L., McCormick, S.T., Simchi-Levi, D.: Findind disjoint paths with different path-costs: Complexity and algorithms. Networks\u00a022, 653\u2013667 (1992)","journal-title":"Networks"},{"key":"37_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/322047.322048","volume":"25","author":"Y. Perl","year":"1978","unstructured":"Perl, Y., Shiloach, Y.: Finding two disjoint paths between two pairs of vertices in a graph. Journal of the ACM\u00a025, 1\u20139 (1978)","journal-title":"Journal of the ACM"},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"Petty, M.D.: Computer generated forces in Distributed Interactive Simulation. In: Proceedings of the Conference on Distributed Interactive Simulation Systems for Simulation and Training in the Aerospace Environment, The International Society for Optical Engineering, Orlando, pp. 251\u2013280 (1995)","DOI":"10.1117\/12.204224"},{"key":"37_CR12","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1002\/(SICI)1097-0037(199807)31:4<259::AID-NET6>3.0.CO;2-C","volume":"31","author":"H. Sherali","year":"1998","unstructured":"Sherali, H., Ozbay, K., Subramanian, S.: The time-dependent shortest pair of disjoint paths problem: complexity, models and algorithms. Networks\u00a031, 259\u2013272 (1998)","journal-title":"Networks"},{"issue":"1","key":"37_CR13","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1137\/0405009","volume":"5","author":"A. Schrijver","year":"1992","unstructured":"Schrijver, A., Seymour, P.: Disjoint paths in a planar graph \u2013 a general theorem. SIAM Journal of Discrete Mathematics\u00a05(1), 112\u2013116 (1992)","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"37_CR14","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1002\/net.3230040204","volume":"4","author":"J.. W. Suurballe","year":"1974","unstructured":"Suurballe, J. W.: Disjoint paths in a network. Networks\u00a04, 125\u2013145 (1974)","journal-title":"Networks"},{"key":"37_CR15","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1002\/net.3230140209","volume":"14","author":"J.W. Suurballe","year":"1984","unstructured":"Suurballe, J.W., Tarjan, R.E.: A quick method for finding shortest pairs of disjoint paths. Networks\u00a014, 325\u2013336 (1984)","journal-title":"Networks"},{"key":"37_CR16","unstructured":"Tarapata, Z.: Multi-paths optimization in unreliable time-dependent networks. In: Proceedings of the 2nd NATO Regional Conference on Military Communication and Information Systems, Zegrze (Poland), October 04-06, vol.\u00a0I, pp. 181\u2013189 (2000)"},{"key":"37_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1007\/978-3-642-04921-7_59","volume-title":"ICANNGA 2009","author":"Z. Tarapata","year":"2009","unstructured":"Tarapata, Z.: Approximation Scheduling Algorithms for Solving Multi-objects Movement Synchronization Problem. In: ICANNGA 2009. LNCS, vol.\u00a05495, pp. 577\u2013589. Springer, Heidelberg (2009)"},{"key":"37_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/978-3-642-12101-2_39","volume-title":"Intelligent Information and Database Systems","author":"Z. Tarapata","year":"2010","unstructured":"Tarapata, Z.: Multiresolution models and algorithms of movement planning and their application for multiresolution battlefield simulation. In: Nguyen, N.T., Le, M.T., \u015awi\u0105tek, J. (eds.) ACIIDS 2010. LNCS, vol.\u00a05991, pp. 378\u2013389. Springer, Heidelberg (2010)"},{"key":"37_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-642-13480-7_31","volume-title":"Agent and Multi-Agent Systems: Technologies and Applications","author":"Z. Tarapata","year":"2010","unstructured":"Tarapata, Z.: Movement Simulation and Management of Cooperating Objects in CGF Systems: a Case Study. In: J\u0119drzejowicz, P., Nguyen, N.T., Howlet, R.J., Jain, L.C. (eds.) KES-AMSTA 2010. LNCS, vol.\u00a06070, pp. 293\u2013304. Springer, Heidelberg (2010)"},{"key":"37_CR20","unstructured":"Tuft, D., Gayle, R., Salomon, B., Govindaraju, N., Lin, M., Manocha, D.: Accelerating Route Planning And Collision Detection for Computer Generated Forces Using GPUS. In: Proc. of Army Science Conference, Orlando (2006)"}],"container-title":["Lecture Notes in Computer Science","Motion in Games"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16958-8_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T21:30:41Z","timestamp":1553203841000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16958-8_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642169571","9783642169588"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16958-8_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}