{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:53:03Z","timestamp":1773481983379,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,11,2]],"date-time":"2021-11-02T00:00:00Z","timestamp":1635811200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,11,2]]},"DOI":"10.1145\/3474717.3483961","type":"proceedings-article","created":{"date-parts":[[2021,11,4]],"date-time":"2021-11-04T22:59:44Z","timestamp":1636066784000},"page":"282-292","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Robust Routing Using Electrical Flows"],"prefix":"10.1145","author":[{"given":"Ali Kemal","family":"Sinop","sequence":"first","affiliation":[{"name":"Google Research"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lisa","family":"Fawcett","sequence":"additional","affiliation":[{"name":"Google Research"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sreenivas","family":"Gollapudi","sequence":"additional","affiliation":[{"name":"Google Research"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kostas","family":"Kollias","sequence":"additional","affiliation":[{"name":"Google Research"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,11,4]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2009. Camvit: Choice routing. http:\/\/www.camvit.com.  2009. Camvit: Choice routing. http:\/\/www.camvit.com."},{"key":"e_1_3_2_1_2_1","volume-title":"Werneck","author":"Abraham Ittai","year":"2013","unstructured":"Ittai Abraham , Daniel Delling , Andrew V. Goldberg , and Renato F . Werneck . 2013 . Alternative routes in road networks. ACM J. Exp. Algorithmics 18 (2013). Ittai Abraham, Daniel Delling, Andrew V. Goldberg, and Renato F. Werneck. 2013. Alternative routes in road networks. ACM J. Exp. Algorithmics 18 (2013)."},{"key":"e_1_3_2_1_3_1","volume-title":"Sketch-based Algorithms for Approximate Shortest Paths in Road Networks. In WWW '21: The Web Conference 2021","author":"Aggarwal Gaurav","year":"2021","unstructured":"Gaurav Aggarwal , Sreenivas Gollapudi , Raghavender R, and Ali Kemal Sinop . 2021 . Sketch-based Algorithms for Approximate Shortest Paths in Road Networks. In WWW '21: The Web Conference 2021 , Ljubljana, Slovenia , April 19-23, 2021. ACM \/ IW3C2. Gaurav Aggarwal, Sreenivas Gollapudi, Raghavender R, and Ali Kemal Sinop. 2021. Sketch-based Algorithms for Approximate Shortest Paths in Road Networks. In WWW '21: The Web Conference 2021, Ljubljana, Slovenia, April 19-23, 2021. ACM \/ IW3C2."},{"key":"e_1_3_2_1_4_1","volume-title":"Theory and Practice of Algorithms in (Computer) Systems, Alberto Marchetti-Spaccamela and Michael Segal (Eds.)","author":"Bader Roland","unstructured":"Roland Bader , Jonathan Dees , Robert Geisberger , and Peter Sanders . 2011. Alternative Route Graphs in Road Networks . In Theory and Practice of Algorithms in (Computer) Systems, Alberto Marchetti-Spaccamela and Michael Segal (Eds.) . Springer Berlin Heidelberg , Berlin, Heidelberg , 21--32. Roland Bader, Jonathan Dees, Robert Geisberger, and Peter Sanders. 2011. Alternative Route Graphs in Road Networks. In Theory and Practice of Algorithms in (Computer) Systems, Alberto Marchetti-Spaccamela and Michael Segal (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 21--32."},{"key":"e_1_3_2_1_5_1","volume-title":"International Symposium on Transportation and Traffic Theory. VNU Press, 299--330","author":"Ben-Akiva M","year":"1984","unstructured":"M Ben-Akiva , M J Bergman , Andrew J Daly , and Rohit Ramaswamy . 1984 . Modeling inter-urban route choice behaviour . In International Symposium on Transportation and Traffic Theory. VNU Press, 299--330 . M Ben-Akiva, M J Bergman, Andrew J Daly, and Rohit Ramaswamy. 1984. Modeling inter-urban route choice behaviour. In International Symposium on Transportation and Traffic Theory. VNU Press, 299--330."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591833"},{"key":"e_1_3_2_1_7_1","volume-title":"PTRC Summer Annual Meeting (SAM).","author":"de la Barra Tomas","year":"1993","unstructured":"Tomas de la Barra and B Perezand J Anez . 1993 . Multidimensional path search and assignment . In PTRC Summer Annual Meeting (SAM). Tomas de la Barra and B Perezand J Anez. 1993. Multidimensional path search and assignment. In PTRC Summer Annual Meeting (SAM)."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2014.0579"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2011.108"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Peter G. Doyle and J. Laurie Snell. 1984. Random walks and electric networks. Mathematical Assn of Amer.  Peter G. Doyle and J. Laurie Snell. 1984. Random walks and electric networks. Mathematical Assn of Amer.","DOI":"10.5948\/UPO9781614440222"},{"key":"e_1_3_2_1_11_1","volume-title":"Goodrich","author":"Eppstein David","year":"2008","unstructured":"David Eppstein and Michael T . Goodrich . 2008 . Studying (non-planar) road networks through an algorithmic lens. In 16th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, ACM-GIS 2008, November 5-7, 2008, Irvine, California, USA, Proceedings, Walid G. Aref, Mohamed F. Mokbel, and Markus Schneider (Eds.). ACM , 16. David Eppstein and Michael T. Goodrich. 2008. Studying (non-planar) road networks through an algorithmic lens. In 16th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, ACM-GIS 2008, November 5-7, 2008, Irvine, California, USA, Proceedings, Walid G. Aref, Mohamed F. Mokbel, and Markus Schneider (Eds.). ACM, 16."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014068"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1110.0401"},{"key":"e_1_3_2_1_14_1","volume-title":"Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008","author":"Harsha Prahladh","year":"2008","unstructured":"Prahladh Harsha , Thomas P. Hayes , Hariharan Narayanan , Harald R\u00e4cke , and Jaikumar Radhakrishnan . 2008 . Minimizing average latency in oblivious routing . In Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008 , San Francisco, California, USA , January 20-22, 2008, Shang-Hua Teng (Ed.). SIAM, 200--207. Prahladh Harsha, Thomas P. Hayes, Hariharan Narayanan, Harald R\u00e4cke, and Jaikumar Radhakrishnan. 2008. Minimizing average latency in oblivious routing. In Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, Shang-Hua Teng (Ed.). SIAM, 200--207."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.06.013"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.68"},{"key":"e_1_3_2_1_18_1","volume-title":"Proceedings of the Meeting on Analytic Algorithmics and Combinatorics. Society for Industrial and Applied Mathematics, 66--74","author":"Lawler Gregory","year":"2009","unstructured":"Gregory Lawler and Hariharan Narayanan . 2009 . Mixing times and lp bounds for oblivious routing . In Proceedings of the Meeting on Analytic Algorithmics and Combinatorics. Society for Industrial and Applied Mathematics, 66--74 . Gregory Lawler and Hariharan Narayanan. 2009. Mixing times and lp bounds for oblivious routing. In Proceedings of the Meeting on Analytic Algorithmics and Combinatorics. Society for Industrial and Applied Mathematics, 66--74."},{"key":"e_1_3_2_1_19_1","volume-title":"SEA 2012, Bordeaux, France, June 7-9, 2012. Proceedings (Lecture Notes in Computer Science), Ralf Klasing (Ed.)","volume":"7276","author":"Luxen Dennis","year":"2012","unstructured":"Dennis Luxen and Dennis Schieferdecker . 2012 . Candidate Sets for Alternative Routes in Road Networks. In Experimental Algorithms - 11th International Symposium , SEA 2012, Bordeaux, France, June 7-9, 2012. Proceedings (Lecture Notes in Computer Science), Ralf Klasing (Ed.) , Vol. 7276 . Springer, 260--270. Dennis Luxen and Dennis Schieferdecker. 2012. Candidate Sets for Alternative Routes in Road Networks. In Experimental Algorithms - 11th International Symposium, SEA 2012, Bordeaux, France, June 7-9, 2012. Proceedings (Lecture Notes in Computer Science), Ralf Klasing (Ed.), Vol. 7276. Springer, 260--270."},{"key":"e_1_3_2_1_20_1","unstructured":"OpenStreetMap contributors. 2017. Planet dump retrieved from https:\/\/planet.osm.org. https:\/\/www.openstreetmap.org.  OpenStreetMap contributors. 2017. Planet dump retrieved from https:\/\/planet.osm.org. https:\/\/www.openstreetmap.org."},{"key":"e_1_3_2_1_21_1","volume-title":"Improved Alternative Route Planning. In 13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2013","volume":"33","author":"Paraskevopoulos Andreas","year":"2013","unstructured":"Andreas Paraskevopoulos and Christos D. Zaroliagis . 2013 . Improved Alternative Route Planning. In 13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2013 , September 5, 2013 , Sophia Antipolis, France (OASICS), Daniele Frigioni and Sebastian Stiller (Eds.) , Vol. 33 . Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 108--122. Andreas Paraskevopoulos and Christos D. Zaroliagis. 2013. Improved Alternative Route Planning. In 13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2013, September 5, 2013, Sophia Antipolis, France (OASICS), Daniele Frigioni and Sebastian Stiller (Eds.), Vol. 33. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 108--122."},{"key":"e_1_3_2_1_22_1","volume-title":"Iterative Methods for Sparse Linear Systems","author":"Saad Yousef","unstructured":"Yousef Saad . 1996. Iterative Methods for Sparse Linear Systems . PWS Publishing Company . Yousef Saad. 1996. Iterative Methods for Sparse Linear Systems. PWS Publishing Company."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.103"},{"key":"e_1_3_2_1_24_1","volume-title":"On Balanced Separators in Road Networks. In 14th International Symposium on Experimental Algorithms (SEA). 286--297","author":"Schild Aaron","year":"2015","unstructured":"Aaron Schild and Christian Sommer . 2015 . On Balanced Separators in Road Networks. In 14th International Symposium on Experimental Algorithms (SEA). 286--297 . Aaron Schild and Christian Sommer. 2015. On Balanced Separators in Road Networks. In 14th International Symposium on Experimental Algorithms (SEA). 286--297."},{"key":"e_1_3_2_1_25_1","volume-title":"Proceedings of the 36th Annual ACM Symposium on Theory of Computing","author":"Daniel","year":"2004","unstructured":"Daniel A. Spielman and Shang-Hua Teng. 2004. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems . In Proceedings of the 36th Annual ACM Symposium on Theory of Computing , Chicago, IL, USA , June 13-16, 2004 , L\u00e1szl\u00f3 Babai (Ed.). ACM, 81--90. Daniel A. Spielman and Shang-Hua Teng. 2004. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004, L\u00e1szl\u00f3 Babai (Ed.). ACM, 81--90."},{"key":"e_1_3_2_1_26_1","volume-title":"Introduction to Applied Mathematics","author":"Strang Gilbert","unstructured":"Gilbert Strang . 1986. Introduction to Applied Mathematics . Wellesley-Cambridge Press . Gilbert Strang. 1986. Introduction to Applied Mathematics. Wellesley-Cambridge Press."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.17.11.712"}],"event":{"name":"SIGSPATIAL '21: 29th International Conference on Advances in Geographic Information Systems","location":"Beijing China","acronym":"SIGSPATIAL '21","sponsor":["SIGSPATIAL ACM Special Interest Group on Spatial Information"]},"container-title":["Proceedings of the 29th International Conference on Advances in Geographic Information Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3474717.3483961","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3474717.3483961","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:11:46Z","timestamp":1750191106000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3474717.3483961"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,2]]},"references-count":26,"alternative-id":["10.1145\/3474717.3483961","10.1145\/3474717"],"URL":"https:\/\/doi.org\/10.1145\/3474717.3483961","relation":{},"subject":[],"published":{"date-parts":[[2021,11,2]]},"assertion":[{"value":"2021-11-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}