{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:33:55Z","timestamp":1742960035290,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031080104"},{"type":"electronic","value":"9783031080111"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-08011-1_27","type":"book-chapter","created":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T16:16:42Z","timestamp":1654791402000},"page":"408-423","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Analyzing the\u00a0Reachability Problem in\u00a0Choice Networks"],"prefix":"10.1007","author":[{"given":"Piotr","family":"Wojciechowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Subramani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alvaro","family":"Velasquez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,10]]},"reference":[{"key":"27_CR1","volume-title":"Network Flows: Theory, Algorithms and Applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice-Hall (1993)"},{"issue":"2","key":"27_CR2","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1145\/77600.77615","volume":"37","author":"RK Ahuja","year":"1990","unstructured":"Ahuja, R.K., Mehlhorn, K., Orlin, J.B., Tarjan, R.E.: Faster algorithms for the shortest path problem. J. ACM 37(2), 213\u2013223 (1990)","journal-title":"J. ACM"},{"issue":"1","key":"27_CR3","first-page":"287","volume":"15","author":"CP Bajaj","year":"1971","unstructured":"Bajaj, C.P.: Some constrained shortest-route problems. Unternehmensforschung 15(1), 287\u2013301 (1971)","journal-title":"Unternehmensforschung"},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.jctb.2016.05.004","volume":"122","author":"J Bang-Jensen","year":"2017","unstructured":"Bang-Jensen, J., Bessy, S., Jackson, B., Kriesell, M.: Antistrong digraphs. J. Comb. Theory Ser. B 122, 68\u201390 (2017)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"4","key":"27_CR5","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/net.3230190402","volume":"19","author":"JE Beasley","year":"1989","unstructured":"Beasley, J.E., Christofides, N.: An algorithm for the resource constrained shortest path problem. Networks 19(4), 379\u2013394 (1989)","journal-title":"Networks"},{"doi-asserted-by":"publisher","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3","key":"27_CR6","DOI":"10.1007\/978-3-319-21275-3"},{"issue":"2","key":"27_CR7","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1002\/net.3230140208","volume":"14","author":"N Deo","year":"1984","unstructured":"Deo, N., Pang, C.Y.: Shortest-path algorithms: taxonomy and annotation. Networks 14(2), 275\u2013323 (1984)","journal-title":"Networks"},{"issue":"1","key":"27_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/10556788.2018.1548015","volume":"35","author":"D Ferone","year":"2020","unstructured":"Ferone, D., Festa, P., Guerriero, F.: An efficient exact approach for the constrained shortest path tour problem. Optim. Methods Softw. 35(1), 1\u201320 (2020)","journal-title":"Optim. Methods Softw."},{"key":"27_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-540-30559-0_21","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"FV Fomin","year":"2004","unstructured":"Fomin, F.V., Kratsch, D., Woeginger, G.J.: Exact (exponential) algorithms for the dominating set problem. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol. 3353, pp. 245\u2013256. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30559-0_21"},{"issue":"3","key":"27_CR10","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1109\/TSE.1976.233819","volume":"2","author":"HN Gabow","year":"1976","unstructured":"Gabow, H.N., Maheswari, S.N., Osterweil, L.J.: On two problems in the generation of program test paths. IEEE Trans. Software Eng. 2(3), 227\u2013231 (1976)","journal-title":"IEEE Trans. Software Eng."},{"key":"27_CR11","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman Company, San Francisco (1979)"},{"issue":"3","key":"27_CR12","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s11590-017-1212-z","volume":"12","author":"M Horv\u00e1th","year":"2017","unstructured":"Horv\u00e1th, M., Kis, T.: Multi-criteria approximation schemes for the resource constrained shortest path problem. Optim. Lett. 12(3), 475\u2013483 (2017). https:\/\/doi.org\/10.1007\/s11590-017-1212-z","journal-title":"Optim. Lett."},{"issue":"3","key":"27_CR13","first-page":"317","volume":"1","author":"V Kann","year":"1994","unstructured":"Kann, V.: Polynomially bounded minimization problems that are hard to approximate. Nordic J. Comput. 1(3), 317\u2013331 (1994)","journal-title":"Nordic J. Comput."},{"doi-asserted-by":"publisher","unstructured":"Kant\u00e9, M.M., Moataz, F.Z., Mom\u00e8ge, B., Nisse, N.: Finding paths in grids with forbidden transitions. In: Mayr, E.W. (ed.) WG 2015. LNCS, vol. 9224, pp. 154\u2013168. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53174-7_12","key":"27_CR14","DOI":"10.1007\/978-3-662-53174-7_12"},{"key":"27_CR15","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.tcs.2018.02.002","volume":"729","author":"HK B\u00fcning","year":"2018","unstructured":"B\u00fcning, H.K., Wojciechowski, P., Subramani, K.: Finding read-once resolution refutations in systems of 2CNF clauses. Theor. Comput. Sci. 729, 42\u201356 (2018)","journal-title":"Theor. Comput. Sci."},{"issue":"13","key":"27_CR16","doi-asserted-by":"publisher","first-page":"2871","DOI":"10.1016\/j.dam.2009.03.018","volume":"157","author":"P Kolman","year":"2009","unstructured":"Kolman, P., Pangr\u00e1c, O.: On the complexity of paths avoiding forbidden pairs. Discret. Appl. Math. 157(13), 2871\u20132876 (2009)","journal-title":"Discret. Appl. Math."},{"issue":"10\u201311","key":"27_CR17","doi-asserted-by":"publisher","first-page":"1506","DOI":"10.1016\/j.dam.2012.12.022","volume":"161","author":"J Kov\u00e1c","year":"2013","unstructured":"Kov\u00e1c, J.: Complexity of the path avoiding forbidden pairs problem revisited. Discret. Appl. Math. 161(10\u201311), 1506\u20131512 (2013)","journal-title":"Discret. Appl. Math."},{"key":"27_CR18","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-981-13-1402-5_29","volume-title":"Data Management, Analytics and Innovation","author":"N Kukunuru","year":"2019","unstructured":"Kukunuru, N.: Secure and energy aware shortest path routing framework for WSN. In: Balas, V.E., Sharma, N., Chakrabarti, A. (eds.) Data Management, Analytics and Innovation. AISC, vol. 808, pp. 379\u2013390. Springer, Singapore (2019). https:\/\/doi.org\/10.1007\/978-981-13-1402-5_29"},{"issue":"1","key":"27_CR19","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/s10878-020-00562-8","volume":"40","author":"Z Hosseini Nodeh","year":"2020","unstructured":"Hosseini Nodeh, Z., Babapour Azar, A., Khanjani Shiraz, R., Khodayifar, S., Pardalos, P.M.: Joint chance constrained shortest path problem with Copula theory. J. Comb. Optim. 40(1), 110\u2013140 (2020)","journal-title":"J. Comb. Optim."},{"unstructured":"Orponen, P., Mannila, H.: On approximation preserving reductions: complete problems and robust measures. Technical report, Department of Computer Science, University of Helsinki (1987)","key":"27_CR20"},{"key":"27_CR21","volume-title":"Papadimitriou","author":"H Christos","year":"1994","unstructured":"Christos, H.: Papadimitriou. Computational Complexity. Addison-Wesley, New York (1994)"},{"issue":"1","key":"27_CR22","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1287\/opre.16.1.205","volume":"16","author":"R Saigal","year":"1968","unstructured":"Saigal, R.: Letter to the editor - a constrained shortest route problem. Oper. Res. 16(1), 205\u2013209 (1968)","journal-title":"Oper. Res."},{"issue":"4","key":"27_CR23","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1287\/trsc.28.4.309","volume":"28","author":"RA Sivakumar","year":"1994","unstructured":"Sivakumar, R.A., Batta, R.: The variance-constrained shortest path problem. Transp. Sci. 28(4), 309\u2013316 (1994)","journal-title":"Transp. Sci."},{"issue":"2\u20133","key":"27_CR24","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/S0166-218X(02)00251-2","volume":"126","author":"S Szeider","year":"2003","unstructured":"Szeider, S.: Finding paths in graphs avoiding forbidden transitions. Discret. Appl. Math. 126(2\u20133), 261\u2013273 (2003)","journal-title":"Discret. Appl. Math."},{"key":"27_CR25","doi-asserted-by":"publisher","first-page":"19303","DOI":"10.1109\/ACCESS.2019.2897339","volume":"7","author":"N Wang","year":"2019","unstructured":"Wang, N., Li, J.: Shortest path routing with risk control for compromised wireless sensor networks. IEEE Access 7, 19303\u201319311 (2019)","journal-title":"IEEE Access"},{"doi-asserted-by":"publisher","unstructured":"Wojciechowski, P., Williamson, M., Subramani, K.: On finding shortest paths in arc-dependent networks. In: Ba\u00efou, M., Gendron, B., G\u00fcnl\u00fck, O., Mahjoub, A.R. (eds.) ISCO 2020. LNCS, vol. 12176, pp. 249\u2013260. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-53262-8_21","key":"27_CR26","DOI":"10.1007\/978-3-030-53262-8_21"},{"issue":"1","key":"27_CR27","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/S0166-218X(96)00017-0","volume":"74","author":"H Yinnone","year":"1997","unstructured":"Yinnone, H.: On paths avoiding forbidden pairs of vertices in a graph. Discret. Appl. Math. 74(1), 85\u201392 (1997)","journal-title":"Discret. Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-08011-1_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,8]],"date-time":"2022-11-08T13:05:31Z","timestamp":1667912731000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-08011-1_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031080104","9783031080111"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-08011-1_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"10 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Los Angeles, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/usc.edu\/cpaior-2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"60","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}