{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T13:09:05Z","timestamp":1765544945162,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,5,13]],"date-time":"2024-05-13T00:00:00Z","timestamp":1715558400000},"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":[[2024,5,13]]},"DOI":"10.1145\/3589334.3645415","type":"proceedings-article","created":{"date-parts":[[2024,5,8]],"date-time":"2024-05-08T07:08:13Z","timestamp":1715152093000},"page":"493-502","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Extracting Small Subgraphs in Road Networks"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7060-6775","authenticated-orcid":false,"given":"Sara","family":"Ahmadian","sequence":"first","affiliation":[{"name":"Google, Seattle, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5732-3164","authenticated-orcid":false,"given":"Sreenivas","family":"Gollapudi","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-9817-6406","authenticated-orcid":false,"given":"Gregory","family":"Hutchins","sequence":"additional","affiliation":[{"name":"Google, Mt Desert, ME, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2889-5363","authenticated-orcid":false,"given":"Kostas","family":"Kollias","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3928-523X","authenticated-orcid":false,"given":"Xizhi","family":"Tan","sequence":"additional","affiliation":[{"name":"Drexel University, Philadelphia, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,5,13]]},"reference":[{"key":"e_1_3_2_2_1_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 , Vol. 18 (2013)."},{"volume-title":"Theory and Practice of Algorithms in (Computer) Systems, Alberto Marchetti-Spaccamela and Michael Segal (Eds.)","author":"Bader Roland","key":"e_1_3_2_2_2_1","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."},{"key":"e_1_3_2_2_3_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."},{"key":"e_1_3_2_2_4_1","volume-title":"Proceedings of the 36th International Conference on Machine Learning, ICML 2019, 9--15","volume":"1435","author":"Crawford Victoria G.","year":"2019","unstructured":"Victoria G. Crawford, Alan Kuhnle, and My T. Thai. 2019. Submodular Cost Submodular Cover with an Approximate Oracle. In Proceedings of the 36th International Conference on Machine Learning, ICML 2019, 9--15 June 2019, Long Beach, California, USA (Proceedings of Machine Learning Research, Vol. 97), , Kamalika Chaudhuri and Ruslan Salakhutdinov (Eds.). PMLR, 1426--1435. http:\/\/proceedings.mlr.press\/v97\/crawford19a.html"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2014.0579"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2011.108"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2009.05.009"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3159697"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1110.0401"},{"key":"e_1_3_2_2_10_1","volume-title":"Bilmes","author":"Iyer Rishabh K.","year":"2013","unstructured":"Rishabh K. Iyer and Jeff A. Bilmes. 2013. Submodular Optimization with Submodular Cover and Submodular Knapsack Constraints. In Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held December 5--8, 2013, Lake Tahoe, Nevada, United States, , Christopher J. C. Burges, L\u00e9 on Bottou, Zoubin Ghahramani, and Kilian Q. Weinberger (Eds.). 2436--2444. https:\/\/proceedings.neurips.cc\/paper\/2013\/hash\/a1d50185e7426cbb0acad1e6ca74b9aa-Abstract.html"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--1--4684--2001--2_9"},{"key":"e_1_3_2_2_12_1","volume-title":"Evolution and Evaluation of the Penalty Method for Alternative Graphs. In 13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2013","volume":"107","author":"Kobitzsch Moritz","year":"2013","unstructured":"Moritz Kobitzsch, Marcel Radermacher, and Dennis Schieferdecker. 2013. Evolution and Evaluation of the Penalty Method for Alternative Graphs. In 13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2013, September 5, 2013, Sophia Antipolis, France (OASICS, Vol. 33), , Daniele Frigioni and Sebastian Stiller (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fc r Informatik, 94--107."},{"key":"e_1_3_2_2_13_1","volume-title":"SEA 2012, Bordeaux, France, June 7--9, 2012. Proceedings (Lecture Notes in Computer Science","volume":"270","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, Vol. 7276), Ralf Klasing (Ed.). Springer, 260--270."},{"key":"e_1_3_2_2_14_1","unstructured":"OpenStreetMap contributors. 2017. Planet dump retrieved from https:\/\/planet.osm.org . https:\/\/www.openstreetmap.org."},{"key":"e_1_3_2_2_15_1","volume-title":"Improved Alternative Route Planning. In 13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2013","volume":"122","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, Vol. 33), Daniele Frigioni and Sebastian Stiller (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fc r Informatik, 108--122."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258641"},{"key":"e_1_3_2_2_17_1","volume-title":"Robust Routing Using Electrical Flows. In SIGSPATIAL '21: 29th International Conference on Advances in Geographic Information Systems, Virtual Event \/ Beijing, China, November 2--5","author":"Sinop Ali Kemal","year":"2021","unstructured":"Ali Kemal Sinop, Lisa Fawcett, Sreenivas Gollapudi, and Kostas Kollias. 2021. Robust Routing Using Electrical Flows. In SIGSPATIAL '21: 29th International Conference on Advances in Geographic Information Systems, Virtual Event \/ Beijing, China, November 2--5, 2021, Xiaofeng Meng, Fusheng Wang, Chang-Tien Lu, Yan Huang, Shashi Shekhar, and Xing Xie (Eds.). ACM, 282--292."},{"key":"e_1_3_2_2_18_1","volume-title":"Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015","author":"Soma Tasuku","year":"2015","unstructured":"Tasuku Soma and Yuichi Yoshida. 2015. A Generalization of Submodular Cover via the Diminishing Return Property on the Integer Lattice. In Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, December 7--12, 2015, Montreal, Quebec, Canada, , Corinna Cortes, Neil D. Lawrence, Daniel D. Lee, Masashi Sugiyama, and Roman Garnett (Eds.). 847--855. https:\/\/proceedings.neurips.cc\/paper\/2015\/hash\/7bcdf75ad237b8e02e301f4091fb6bc8-Abstract.html"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-009--9269-y"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579435"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.17.11.712"}],"event":{"name":"WWW '24: The ACM Web Conference 2024","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"location":"Singapore Singapore","acronym":"WWW '24"},"container-title":["Proceedings of the ACM Web Conference 2024"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3589334.3645415","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3589334.3645415","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T00:26:44Z","timestamp":1755822404000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3589334.3645415"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,13]]},"references-count":21,"alternative-id":["10.1145\/3589334.3645415","10.1145\/3589334"],"URL":"https:\/\/doi.org\/10.1145\/3589334.3645415","relation":{},"subject":[],"published":{"date-parts":[[2024,5,13]]},"assertion":[{"value":"2024-05-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}