{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:19:43Z","timestamp":1750220383045,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,21]],"date-time":"2021-07-21T00:00:00Z","timestamp":1626825600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,21]]},"DOI":"10.1145\/3465084.3467913","type":"proceedings-article","created":{"date-parts":[[2021,7,23]],"date-time":"2021-07-23T21:09:28Z","timestamp":1627074568000},"page":"435-443","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs"],"prefix":"10.1145","author":[{"given":"Greg","family":"Bodwin","sequence":"first","affiliation":[{"name":"University of Michigan, Ann Arbor, MI, USA"}]},{"given":"Merav","family":"Parter","sequence":"additional","affiliation":[{"name":"Weizmann Institute of Science, Rehovot, Israel"}]}],"member":"320","published-online":{"date-parts":[[2021,7,23]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214084"},{"key":"e_1_3_2_2_2_1","volume-title":"Forbidden-set distance labels for graphs of bounded doubling dimension. ACM Transactions on Algorithms (TALG) 12, 2","author":"Abraham I.","year":"2016","unstructured":"Abraham , I. , Chechik , S. , Gavoille , C. , and Peleg , D . Forbidden-set distance labels for graphs of bounded doubling dimension. ACM Transactions on Algorithms (TALG) 12, 2 ( 2016 ), 1--17. Abraham, I., Chechik, S., Gavoille, C., and Peleg, D. Forbidden-set distance labels for graphs of bounded doubling dimension. ACM Transactions on Algorithms (TALG) 12, 2 (2016), 1--17."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-002-0080-6"},{"key":"e_1_3_2_2_4_1","first-page":"1","volume-title":"35th Symposium on Theoretical Aspects of Computer Science, STACS 2018","author":"Bil\u00f2 D.","year":"2018","unstructured":"Bil\u00f2 , D. , Choudhary , K. , Gual\u00e0 , L. , Leucci , S. , Parter , M. , and Proietti , G . Efficient oracles and routing schemes for replacement paths . In 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018 , February 28 to March 3, 2018 , Caen, France (2018), pp. 13: 1 -- 13 :15. Bil\u00f2, D., Choudhary, K., Gual\u00e0, L., Leucci, S., Parter, M., and Proietti, G. Efficient oracles and routing schemes for replacement paths. In 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France (2018), pp. 13:1--13:15."},{"key":"e_1_3_2_2_5_1","volume-title":"35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)","author":"Bil\u00f2 D.","year":"2018","unstructured":"Bil\u00f2 , D. , Choudhary , K. , Gual\u00e0 , L. , Leucci , S. , Parter , M. , and Proietti , G . Efficient oracles and routing schemes for replacement paths . In 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018) ( 2018 ), Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. Bil\u00f2, D., Choudhary, K., Gual\u00e0, L., Leucci, S., Parter, M., and Proietti, G. Efficient oracles and routing schemes for replacement paths. In 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018) (2018), Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48350-3_15"},{"key":"e_1_3_2_2_7_1","series-title":"Leibniz International Proceedings in Informatics (LIPIcs)","first-page":"1","volume-title":"47th International Colloquium on Automata, Languages, and Programming (ICALP 2020) (Dagstuhl","author":"Bodwin G.","year":"2020","unstructured":"Bodwin , G. , Choudhary , K. , Parter , M. , and Shahar , N . New Fault Tolerant Subset Preservers . In 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020) (Dagstuhl , Germany, 2020 ), A. Czumaj, A. Dawar, and E. Merelli, Eds., vol. 168 of Leibniz International Proceedings in Informatics (LIPIcs) , Schloss Dagstuhl--Leibniz-Zentrum f\u00fcr Informatik , pp. 15: 1 -- 15 :19. Bodwin, G., Choudhary, K., Parter, M., and Shahar, N. New Fault Tolerant Subset Preservers. In 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020) (Dagstuhl, Germany, 2020), A. Czumaj, A. Dawar, and E. Merelli, Eds., vol. 168 of Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl--Leibniz-Zentrum f\u00fcr Informatik, pp. 15:1--15:19."},{"key":"e_1_3_2_2_8_1","volume-title":"44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)","author":"Bodwin G.","year":"2017","unstructured":"Bodwin , G. , Grandoni , F. , Parter , M. , and Vassilevska Williams , V. Preserving distances in very faulty graphs. In 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017) ( 2017 ), Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. Bodwin, G., Grandoni, F., Parter, M., and Vassilevska Williams, V. Preserving distances in very faulty graphs. In 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017) (2017), Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34611-8_22"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/2781925.2782542"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/3310435.3310561"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.96"},{"key":"e_1_3_2_2_13_1","volume-title":"2nd Workshop on Locality Preserving Distributed Computing Methods (LOCALITY)\", Co-located with PODC","author":"Courcelle B.","year":"2007","unstructured":"Courcelle , B. , Gavoille , C. , Kant\u00e9 , M. , and Twigg , A . Forbidden-set labeling on graphs . In 2nd Workshop on Locality Preserving Distributed Computing Methods (LOCALITY)\", Co-located with PODC ( 2007 ). Courcelle, B., Gavoille, C., Kant\u00e9, M., and Twigg, A. Forbidden-set labeling on graphs. In 2nd Workshop on Locality Preserving Distributed Computing Methods (LOCALITY)\", Co-located with PODC (2007)."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70918-3_4"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993806.1993830"},{"volume-title":"Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing (2020), PODC '20.","author":"Dinitz M.","key":"e_1_3_2_2_16_1","unstructured":"Dinitz , M. , and Robelle , C . Efficient and simple algorithms for fault-tolerant spanners . In Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing (2020), PODC '20. Dinitz, M., and Robelle, C. Efficient and simple algorithms for fault-tolerant spanners. In Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing (2020), PODC '20."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/11600930_18"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.05.002"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767417"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2935764.2935795"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3382734.3405714"},{"key":"e_1_3_2_2_22_1","volume-title":"44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)","author":"Gupta M.","year":"2017","unstructured":"Gupta , M. , and Khan , S . Multiple source dual fault tolerant bfs trees. In 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017) ( 2017 ), Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. Gupta, M., and Khan, S. Multiple source dual fault tolerant bfs trees. In 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017) (2017), Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959899"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01215349"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(89)90065-5"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.383347"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767408"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-015-0252-9"},{"key":"e_1_3_2_2_29_1","first-page":"1","volume-title":"34th International Symposium on Distributed Computing, DISC 2020, October 12-16, 2020, Virtual Conference","author":"Parter M.","year":"2020","unstructured":"Parter , M. Distributed constructions of dual-failure fault-tolerant distance preservers . In 34th International Symposium on Distributed Computing, DISC 2020, October 12-16, 2020, Virtual Conference ( 2020 ), pp. 21: 1 -- 21 :17. Parter, M. Distributed constructions of dual-failure fault-tolerant distance preservers. In 34th International Symposium on Distributed Computing, DISC 2020, October 12-16, 2020, Virtual Conference (2020), pp. 21:1--21:17."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/2634074.2634154"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719772"},{"key":"e_1_3_2_2_32_1","volume-title":"Labelling and implicit routing in networks. The computer journal 28, 1","author":"Santoro N.","year":"1985","unstructured":"Santoro , N. , and Khatib , R . Labelling and implicit routing in networks. The computer journal 28, 1 ( 1985 ), 5--8. Santoro, N., and Khatib, R. Labelling and implicit routing in networks. The computer journal 28, 1 (1985), 5--8."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00034"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.68"},{"key":"e_1_3_2_2_35_1","volume-title":"Replacement paths and distance sensitivity oracles via fast matrix multiplication. ACM Transactions on Algorithms (TALG) 9, 2","author":"Weimann O.","year":"2013","unstructured":"Weimann , O. , and Yuster , R . Replacement paths and distance sensitivity oracles via fast matrix multiplication. ACM Transactions on Algorithms (TALG) 9, 2 ( 2013 ), 14. Weimann, O., and Yuster, R. Replacement paths and distance sensitivity oracles via fast matrix multiplication. ACM Transactions on Algorithms (TALG) 9, 2 (2013), 14."}],"event":{"name":"PODC '21: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Virtual Event Italy","acronym":"PODC '21"},"container-title":["Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465084.3467913","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3465084.3467913","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:18:25Z","timestamp":1750191505000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465084.3467913"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,21]]},"references-count":35,"alternative-id":["10.1145\/3465084.3467913","10.1145\/3465084"],"URL":"https:\/\/doi.org\/10.1145\/3465084.3467913","relation":{},"subject":[],"published":{"date-parts":[[2021,7,21]]},"assertion":[{"value":"2021-07-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}