{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T21:18:08Z","timestamp":1763414288640,"version":"3.45.0"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032111265","type":"print"},{"value":"9783032111272","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T00:00:00Z","timestamp":1763424000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T00:00:00Z","timestamp":1763424000000},"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-11127-2_7","type":"book-chapter","created":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T20:03:59Z","timestamp":1763409839000},"page":"76-81","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Brief Announcement: The Steiner Shortest Path Tree Problem"],"prefix":"10.1007","author":[{"given":"Omer","family":"Asher","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yefim","family":"Dinitz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shlomi","family":"Dolev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li-on","family":"Raviv","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baruch","family":"Schieber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,18]]},"reference":[{"key":"7_CR1","unstructured":"Asher, O., Dinitz, Y., Dolev, S., Raviv, L.O., Schieber, B.: The steiner shortest path tree problem. CoRR (2025). arxiv preprint arxiv:2509.06789"},{"issue":"1","key":"7_CR2","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1006\/jagm.1999.1042","volume":"33","author":"M Charikar","year":"1999","unstructured":"Charikar, M., et al.: Approximation algorithms for directed steiner problems. J. Algor. 33(1), 73\u201391 (1999)","journal-title":"J. Algor."},{"issue":"3","key":"7_CR3","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V Chvatal","year":"1979","unstructured":"Chvatal, V.: A greedy heuristic for the set-covering problem. Math. Oper. Res. 4(3), 233\u2013235 (1979)","journal-title":"Math. Oper. Res."},{"issue":"5","key":"7_CR4","first-page":"1277","volume":"11","author":"EA Dinic","year":"1970","unstructured":"Dinic, E.A.: An algorithm for the solution of the max-flow problem with the polynomial estimation. Soviet Math. Dokl. 11(5), 1277\u20131280 (1970)","journal-title":"Soviet Math. Dokl."},{"key":"7_CR5","unstructured":"Dinitz, Y., Dolev, S., Kumar, M.: Polynomial time prioritized multi-criteria $$k$$-shortest paths and $$k$$-disjoint all-criteria-shortest paths. CoRR arxiv:2101.11514 (2021)"},{"issue":"4","key":"7_CR6","doi-asserted-by":"publisher","first-page":"996","DOI":"10.1137\/13094791X","volume":"44","author":"M Elkin","year":"2015","unstructured":"Elkin, M., Solomon, S.: Steiner shallow-light trees are exponentially lighter than spanning ones. SIAM J. Comput. 44(4), 996\u20131025 (2015)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"7_CR7","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s10107-009-0297-2","volume":"128","author":"L Gouveia","year":"2011","unstructured":"Gouveia, L., Simonetti, L., Uchoa, E.: Modeling hop-constrained and diameter-constrained minimum spanning tree problems as steiner tree problems over layered graphs. Math. Program. 128(1), 123\u2013148 (2011)","journal-title":"Math. Program."},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Grandoni, F., Laekhanukit, B., Li, S.: $${O}(\\log ^2{k}\/\\log \\log {k})$$-approximation algorithm for directed steiner tree: A tight quasi-polynomial time algorithm. SIAM J. Comput. 52(2), STOC19-298\u2013STOC19-322 (2023)","DOI":"10.1137\/20M1312988"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Miller, T.: Hierarchical Operations and Supply Chain Planning. Springer, Heidelberg (2002)","DOI":"10.1007\/978-1-4471-0305-9"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-11127-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T20:04:00Z","timestamp":1763409840000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-11127-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,18]]},"ISBN":["9783032111265","9783032111272"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-11127-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,18]]},"assertion":[{"value":"18 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Stabilizing, Safety, and Security of Distributed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kathmandu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nepal","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":"9 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sss2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}