{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:27:57Z","timestamp":1743035277326,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030592660"},{"type":"electronic","value":"9783030592677"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-59267-7_10","type":"book-chapter","created":{"date-parts":[[2020,10,11]],"date-time":"2020-10-11T19:02:33Z","timestamp":1602442953000},"page":"107-118","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["LP-Based Algorithms for Computing Maximum Vertex-Disjoint Paths with Different Colors"],"prefix":"10.1007","author":[{"given":"Yunyun","family":"Deng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kewen","family":"Liao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Longkun","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,9]]},"reference":[{"key":"10_CR1","unstructured":"https:\/\/standards.ieee.org\/standard\/802_1D-2004.html"},{"issue":"1","key":"10_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3390\/a6010001","volume":"6","author":"P Bonizzoni","year":"2013","unstructured":"Bonizzoni, P., Dondi, R., Pirola, Y.: Maximum disjoint paths on edge-colored graphs: approximability and tractability. Algorithms 6(1), 1\u201311 (2013)","journal-title":"Algorithms"},{"issue":"4","key":"10_CR3","doi-asserted-by":"publisher","first-page":"1380","DOI":"10.1016\/j.jnca.2011.03.022","volume":"34","author":"Y Challal","year":"2011","unstructured":"Challal, Y., Ouadjaout, A., Lasla, N., Bagaa, M., Hadjidj, A.: Secure and efficient disjoint multipath construction for fault tolerant routing in wireless sensor networks. J. Netw. Comput. Appl. 34(4), 1380\u20131397 (2011)","journal-title":"J. Netw. Comput. Appl."},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Khanna, S., Shepherd, F.B.: The all-or-nothing multicommodity flow problem. In: Proceedings of the Thirty-sixth Annual ACM Symposium on Theory of Computing, pp. 156\u2013165. ACM (2004)","DOI":"10.1145\/1007352.1007383"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Khanna, S., Shepherd, F.B.: Multicommodity flow, well-linked terminals, and routing problems. In: Proceedings of the Thirty-seventh Annual ACM Symposium on Theory of Computing, pp. 183\u2013192. ACM (2005)","DOI":"10.1145\/1060590.1060618"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-319-94776-1_2","volume-title":"Computing and Combinatorics","author":"Y Deng","year":"2018","unstructured":"Deng, Y., Guo, L., Huang, P.: Exact algorithms for finding partial edge-disjoint paths. In: Wang, L., Zhu, D. (eds.) COCOON 2018. LNCS, vol. 10976, pp. 14\u201325. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94776-1_2"},{"issue":"4","key":"10_CR7","doi-asserted-by":"publisher","first-page":"1315","DOI":"10.1007\/s10878-017-0238-6","volume":"36","author":"R Dondi","year":"2017","unstructured":"Dondi, R., Sikora, F.: Finding disjoint paths on edge-colored graphs: more tractability results. J. Comb. Optim. 36(4), 1315\u20131332 (2017). https:\/\/doi.org\/10.1007\/s10878-017-0238-6","journal-title":"J. Comb. Optim."},{"issue":"2","key":"10_CR8","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0304-3975(80)90009-2","volume":"10","author":"S Fortune","year":"1980","unstructured":"Fortune, S., Hopcroft, J., Wyllie, J.: The directed subgraph homeomorphism problem. Theoret. Comput. Sci. 10(2), 111\u2013121 (1980)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10_CR9","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/0095-8956(85)90046-2","volume":"39","author":"A Frank","year":"1985","unstructured":"Frank, A.: Edge-disjoint paths in planar graphs. J. Comb. Theory Ser. B 39(2), 164\u2013178 (1985)","journal-title":"J. Comb. Theory Ser. B"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Guo, L., Deng, Y., Liao, K., He, Q., Sellis, T., Hu, Z.: A fast algorithm for optimally finding partially disjoint shortest paths. In: IJCAI, pp. 1456\u20131462 (2018)","DOI":"10.24963\/ijcai.2018\/202"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.jnca.2016.12.011","volume":"85","author":"A Hou","year":"2017","unstructured":"Hou, A., Wu, C.Q., Fang, D., Wang, Y., Wang, M.: Bandwidth scheduling for big data transfer using multiple fixed node-disjoint paths. J. Network Comput. Appl. 85, 47\u201355 (2017)","journal-title":"J. Network Comput. Appl."},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Kawarabayashi, K.I., Kobayashi, Y.: All-or-nothing multicommodity flow problem with bounded fractionality in planar graphs. In: IEEE Symposium on Foundations of Computer Science (2013)","DOI":"10.1109\/FOCS.2013.28"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.jnca.2014.04.004","volume":"43","author":"G Lin","year":"2014","unstructured":"Lin, G., Soh, S., Chin, K.-W., Lazarescu, M.: Energy aware two disjoint paths routing. J. Netw. Comput. Appl. 43, 27\u201341 (2014)","journal-title":"J. Netw. Comput. Appl."},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1006\/jctb.1995.1006","volume":"63","author":"N Robertson","year":"1995","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. XIII. The disjoint paths problem. J. Combin. Theory Ser. B 63, 65\u2013110 (1995)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"4","key":"10_CR15","doi-asserted-by":"publisher","first-page":"780","DOI":"10.1137\/S0097539792224061","volume":"23","author":"A Schrijver","year":"1994","unstructured":"Schrijver, A.: Finding k disjoint paths in a directed planar graph. SIAM J. Comput. 23(4), 780\u2013788 (1994)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10_CR16","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1145\/322203.322207","volume":"27","author":"Y Shiloach","year":"1980","unstructured":"Shiloach, Y.: A polynomial solution to the undirected two paths problem. J. the ACM (JACM) 27(3), 445\u2013456 (1980)","journal-title":"J. the ACM (JACM)"},{"issue":"1","key":"10_CR17","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s00224-005-1256-9","volume":"39","author":"T Tholey","year":"2006","unstructured":"Tholey, T.: Solving the 2-disjoint paths problem in nearly linear time. Theory Comput. Syst. 39(1), 51\u201378 (2006)","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"10_CR18","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.disopt.2012.01.002","volume":"9","author":"BY Wu","year":"2012","unstructured":"Wu, B.Y.: On the maximum disjoint paths problem on edge-colored graphs. Discrete Optim. 9(1), 50\u201357 (2012)","journal-title":"Discrete Optim."},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Yallouz, J., Rottenstreich, O., Babarczi, P., Mendelson, A., Orda., A.: Optimal link-disjoint node-\u201csomewhat disjoint\" paths. In: 2016 IEEE 24th International Conference on Network Protocols (ICNP), pp. 1\u201310. IEEE (2016)","DOI":"10.1109\/ICNP.2016.7784451"},{"key":"10_CR20","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.tcs.2017.07.027","volume":"695","author":"S Zhang","year":"2017","unstructured":"Zhang, S., Chen, L., Yang, W.: On fault-tolerant path optimization under QoS constraint in multi-channel wireless networks. Theoret. Comput. Sci. 695, 74\u201382 (2017)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-59267-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T18:09:05Z","timestamp":1710353345000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-59267-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030592660","9783030592677"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-59267-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"9 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TAMC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Theory and Applications of Models of Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Changsha","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tamc2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/tamc2020.csu.edu.cn\/","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":"83","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":"37","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":"45% - 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":"7","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)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}