{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T21:28:14Z","timestamp":1762291694576,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":8,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032095237","type":"print"},{"value":"9783032095244","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T00:00:00Z","timestamp":1762300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T00:00:00Z","timestamp":1762300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-09524-4_15","type":"book-chapter","created":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T21:14:05Z","timestamp":1762290845000},"page":"217-230","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Maximum Path Sets in\u00a0Trees"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-9052-2685","authenticated-orcid":false,"given":"A.","family":"Subramani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5821-5117","authenticated-orcid":false,"given":"K.","family":"Subramani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacob","family":"Restanio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,5]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Amouzegar, M.A., Tripp, R.S., Galway, L.A.: Integrated logistics planning for the air and space expeditionary force. J. Oper. Res. Soc. 55(4), 422\u2013430 (2004)","DOI":"10.1057\/palgrave.jors.2601704"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Bayless, S., et al.: Debugging network reachability with blocked paths. In: Silva, A., Rustan, K., Leino, M. (eds.) Computer Aided Verification. Lecture Notes in Computer Science, pp. 851\u2013862. Springer International Publishing, Cham (2021)","DOI":"10.1007\/978-3-030-81688-9_39"},{"key":"15_CR3","unstructured":"Cheng, Y., Cai, Z., Goebel, R., Lin, G., Zhu, B.: The radiation hybrid map construction problem: recognition, hardness, and approximation algorithms. Unpublished Manuscript (2008)"},{"key":"15_CR4","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press, Cambridge (2009)","edition":"3"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Parlangeli, G., Notarstefano, G.: On the reachability and observability of path and cycle graphs. IEEE Trans. Auotmatic Control 743\u2013748 (2012)","DOI":"10.1109\/TAC.2011.2168912"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Rodrigues, M.B., Karpowicz, M., Kang, K.: A readiness analysis for the argentine air force and the Brazilian navy A-4 fleet via consolidated logistics support. In: Proceedings of the 32nd Conference on Winter simulation, WSC 2000, Wyndham Palace Resort & Spa, Orlando, FL, USA, December 10\u201313, 2000, pp. 1068\u20131074. WSC (2000)","DOI":"10.1109\/WSC.2000.899913"},{"issue":"3","key":"15_CR7","doi-asserted-by":"publisher","first-page":"2764","DOI":"10.1109\/TNSM.2021.3082283","volume":"18","author":"P Sun","year":"2021","unstructured":"Sun, P., Kooij, R.E., Van Mieghem, P.: Reachability-based robustness of controllability in sparse communication networks. IEEE Trans. Netw. Serv. Manage. 18(3), 2764\u20132775 (2021)","journal-title":"IEEE Trans. Netw. Serv. Manage."},{"key":"15_CR8","volume-title":"Integer Programming","author":"LA Wolsey","year":"1998","unstructured":"Wolsey, L.A.: Integer Programming. John Wiley & Sons, New York (1998)"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-09524-4_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T21:14:06Z","timestamp":1762290846000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-09524-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,5]]},"ISBN":["9783032095237","9783032095244"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-09524-4_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,5]]},"assertion":[{"value":"5 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Reachability Problems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 October 2025","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":"rp2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/rp25.software.imdea.org\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}