{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T11:06:05Z","timestamp":1776337565743,"version":"3.51.2"},"publisher-location":"New York, NY, USA","reference-count":57,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,9]],"date-time":"2021-06-09T00:00:00Z","timestamp":1623196800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Google Faculty Award"},{"name":"ARC","award":["DP200102611, DP180102050"],"award-info":[{"award-number":["DP200102611, DP180102050"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,9]]},"DOI":"10.1145\/3448016.3457247","type":"proceedings-article","created":{"date-parts":[[2021,6,18]],"date-time":"2021-06-18T17:22:39Z","timestamp":1624036959000},"page":"1906-1919","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["Public Transport Planning"],"prefix":"10.1145","author":[{"given":"Sheng","family":"Wang","sequence":"first","affiliation":[{"name":"New York University, Brooklyn, NY, USA"}]},{"given":"Yuan","family":"Sun","sequence":"additional","affiliation":[{"name":"Monash University, Melbourne, VIC, Australia"}]},{"given":"Christopher","family":"Musco","sequence":"additional","affiliation":[{"name":"New York University, Brooklyn, NY, USA"}]},{"given":"Zhifeng","family":"Bao","sequence":"additional","affiliation":[{"name":"RMIT University, Melbourne, VIC, Australia"}]}],"member":"320","published-online":{"date-parts":[[2021,6,18]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1080\/23249935.2020.1720042"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-003-0438-y"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1944345.1944349"},{"key":"e_1_3_2_2_4_1","volume-title":"Thomas Pajor, Peter Sanders, Dorothea Wagner, and Renato F Werneck.","author":"Bast Hannah","year":"2016","unstructured":"Hannah Bast , Daniel Delling , Andrew Goldberg , Matthias M\u00fc ller-Hannemann , Thomas Pajor, Peter Sanders, Dorothea Wagner, and Renato F Werneck. 2016 . Route Planning in Transportation Networks. In Algorithm Engineering . 19--80. Hannah Bast, Daniel Delling, Andrew Goldberg, Matthias M\u00fc ller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, and Renato F Werneck. 2016. Route Planning in Transportation Networks. In Algorithm Engineering. 19--80."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"crossref","unstructured":"Gernot Veit Batz and Peter Sanders. 2012. Time-dependent route planning with generalized objective functions. In ESA . 169--180.  Gernot Veit Batz and Peter Sanders. 2012. Time-dependent route planning with generalized objective functions. In ESA . 169--180.","DOI":"10.1007\/978-3-642-33090-2_16"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/17M1140108"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tranpol.2007.04.009"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.2001.11919754"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"crossref","unstructured":"Hau Chan Leman Akoglu and Hanghang Tong. 2014. Make it or break it: Manipulating robustness in large networks. In SDM . 325--333.  Hau Chan Leman Akoglu and Hanghang Tong. 2014. Make it or break it: Manipulating robustness in large networks. In SDM . 325--333.","DOI":"10.1137\/1.9781611973440.37"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"crossref","unstructured":"Chen Chen Ruiyue Peng Lei Ying and Hanghang Tong. 2018. Network Connectivity Optimization: Fundamental Limits and Effective Algorithms. In KDD . 1167--1176.  Chen Chen Ruiyue Peng Lei Ying and Hanghang Tong. 2018. Network Connectivity Optimization: Fundamental Limits and Effective Algorithms. In KDD . 1167--1176.","DOI":"10.1145\/3219819.3220019"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2014.2298892"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2007.06.020"},{"key":"e_1_3_2_2_14_1","volume-title":"Austin R. Benson, and David Bindel","author":"Dong Kun","year":"2019","unstructured":"Kun Dong , Austin R. Benson, and David Bindel . 2019 . Network density of states. In KDD. 1152--1161. Kun Dong, Austin R. Benson, and David Bindel. 2019. Network density of states. In KDD. 1152--1161."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0009-2614(00)00158-5"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.35.11.652"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1061\/(ASCE)0733-947X(2006)132:1(40)"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.21136\/CMJ.1973.101168"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"crossref","unstructured":"Naveen Garg. 2005. Saving an Epsilon: a 2-approximation for the k-MST problem in graphs. In STOC . 396--402.  Naveen Garg. 2005. Saving an Epsilon: a 2-approximation for the k-MST problem in graphs. In STOC . 396--402.","DOI":"10.1145\/1060590.1060650"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"crossref","unstructured":"Robert Geisberger Moritz Kobitzsch and Peter Sanders. 2010. Route planning with flexible objective functions. In ALENEX . 124--137.  Robert Geisberger Moritz Kobitzsch and Peter Sanders. 2010. Route planning with flexible objective functions. In ALENEX . 124--137.","DOI":"10.1137\/1.9781611972900.12"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tra.2008.03.011"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.04.059"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1080\/03610919008812866"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.5038\/2375-0901.16.3.2"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jtrangeo.2014.04.016"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-016-0948-6"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"crossref","unstructured":"Yin Lou Chengyang Zhang Yu Zheng Xing Xie Wei Wang and Yan Huang. 2009. Map-matching for low-sampling-rate GPS trajectories. In GIS . 352--361.  Yin Lou Chengyang Zhang Yu Zheng Xing Xie Wei Wang and Yan Huang. 2009. Map-matching for low-sampling-rate GPS trajectories. In GIS . 352--361.","DOI":"10.1145\/1653771.1653820"},{"key":"e_1_3_2_2_28_1","unstructured":"Raphael A Meyer Cameron Musco Christopher Musco and David P Woodruff. 2021. Hutch  Raphael A Meyer Cameron Musco Christopher Musco and David P Woodruff. 2021. Hutch"},{"key":"e_1_3_2_2_29_1","unstructured":": Optimal Stochastic Trace Estimation . In SOSA. 142--155.  : Optimal Stochastic Trace Estimation . In SOSA. 142--155."},{"key":"e_1_3_2_2_30_1","volume-title":"Towards an Optimal Bus Frequency Scheduling : When the Waiting Time Matters . TKDE","author":"Mo Songsong","year":"2021","unstructured":"Songsong Mo , Zhifeng Bao , Baihua Zheng , and Zhiyong Peng . 2021. Towards an Optimal Bus Frequency Scheduling : When the Waiting Time Matters . TKDE ( 2021 ). Songsong Mo, Zhifeng Bao, Baihua Zheng, and Zhiyong Peng. 2021. Towards an Optimal Bus Frequency Scheduling : When the Waiting Time Matters . TKDE (2021)."},{"key":"e_1_3_2_2_31_1","unstructured":"Cameron Musco and Christopher Musco. 2015. Randomized Block Krylov Methods for Stronger and Faster Approximate Singular Value Decomposition. In NeurIPS. 1396--1404.  Cameron Musco and Christopher Musco. 2015. Randomized Block Krylov Methods for Stronger and Faster Approximate Singular Value Decomposition. In NeurIPS. 1396--1404."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"crossref","unstructured":"Cameron Musco Christopher Musco and Aaron Sidford. 2018. Stability of the Lanczos method for matrix function approximation. In SODA . 1605--1624.  Cameron Musco Christopher Musco and Aaron Sidford. 2018. Stability of the Lanczos method for matrix function approximation. In SODA . 1605--1624.","DOI":"10.1137\/1.9781611975031.105"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1644015.1644020"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"crossref","unstructured":"Lorenzo Orecchia Sushant Sachdeva and Nisheeth K Vishnoi. 2012. Approximating the exponential the lanczos method and an $tildeO(m)$-time spectral algorithm for balanced separator. In STOC. 1141--1160.  Lorenzo Orecchia Sushant Sachdeva and Nisheeth K Vishnoi. 2012. Approximating the exponential the lanczos method and an $tildeO(m)$-time spectral algorithm for balanced separator. In STOC. 1141--1160.","DOI":"10.1145\/2213977.2214080"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2015.2496783"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-014-9220-1"},{"key":"e_1_3_2_2_38_1","volume-title":"An introduction to sustainable transportation: Policy, planning and implementation","author":"Schiller Preston L","unstructured":"Preston L Schiller and Jeffrey R Kenworthy . 2017. An introduction to sustainable transportation: Policy, planning and implementation . Routledge . Preston L Schiller and Jeffrey R Kenworthy. 2017. An introduction to sustainable transportation: Policy, planning and implementation. Routledge."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.3141\/2090-11"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1080\/03081060.2016.1160582"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1104974"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"crossref","unstructured":"Shashanka Ubaru and Yousef Saad. 2018. Applications of trace estimation techniques. In HPCSE. 19--33.  Shashanka Ubaru and Yousef Saad. 2018. Applications of trace estimation techniques. In HPCSE. 19--33.","DOI":"10.1007\/978-3-319-97136-0_2"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.14778\/3384345.3384348"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2776268"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.14778\/3357377.3357380"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3209978.3209989"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.14778\/3425879.3425891"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"crossref","unstructured":"Sibo Wang Wenqing Lin Yi Yang Xiaokui Xiao and Shuigeng Zhou. 2015. Efficient Route Planning on Public Transportation Networks : A Labelling Approach. In SIGMOD . 967--982.  Sibo Wang Wenqing Lin Yi Yang Xiaokui Xiao and Shuigeng Zhou. 2015. Efficient Route Planning on Public Transportation Networks : A Labelling Approach. In SIGMOD . 967--982.","DOI":"10.1145\/2723372.2749456"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"crossref","unstructured":"Sheng Wang Yuan Sun Christopher Musco and Zhifeng Bao. 2021. Public Transport Planning: When Transit Network Connectivity Meets Commuting Demand. arxiv: 2103.16084 [cs.DB]  Sheng Wang Yuan Sun Christopher Musco and Zhifeng Bao. 2021. Public Transport Planning: When Transit Network Connectivity Meets Commuting Demand. arxiv: 2103.16084 [cs.DB]","DOI":"10.1145\/3448016.3457247"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2013.10.008"},{"key":"e_1_3_2_2_51_1","volume-title":"2020 a. Pareto-Optimal Transit Route Planning With Multi-Objective Monte-Carlo Tree Search","author":"Weng Di","year":"2020","unstructured":"Di Weng , Ran Chen , Jianhui Zhang , Jie Bao , Yu Zheng , and Yingcai Wu . 2020 a. Pareto-Optimal Transit Route Planning With Multi-Objective Monte-Carlo Tree Search . IEEE Transactions on Intelligent Transportation Systems ( 2020 ), 1--11. Di Weng, Ran Chen, Jianhui Zhang, Jie Bao, Yu Zheng, and Yingcai Wu. 2020 a. Pareto-Optimal Transit Route Planning With Multi-Objective Monte-Carlo Tree Search . IEEE Transactions on Intelligent Transportation Systems (2020), 1--11."},{"key":"e_1_3_2_2_52_1","volume-title":"2020 b. Towards Better Bus Networks: A Visual Analytics Approach","author":"Weng Di","year":"2020","unstructured":"Di Weng , Chengbo Zheng , Zikun Deng , Mingze Ma , Jie Bao , Yu Zheng , Mingliang Xu , and Yingcai Wu . 2020 b. Towards Better Bus Networks: A Visual Analytics Approach . IEEE Transactions on Visualization and Computer Graphics ( 2020 ). arxiv: 2008.10915 Di Weng, Chengbo Zheng, Zikun Deng, Mingze Ma, Jie Bao, Yu Zheng, Mingliang Xu, and Yingcai Wu. 2020 b. Towards Better Bus Networks: A Visual Analytics Approach . IEEE Transactions on Visualization and Computer Graphics (2020). arxiv: 2008.10915"},{"key":"e_1_3_2_2_53_1","volume-title":"Introduction to graph theory","author":"West Douglas Brent","unstructured":"Douglas Brent West and Others. 1996. Introduction to graph theory . Vol. 2 . Prentice hall Upper Saddle River, NJ. Douglas Brent West and Others. 1996. Introduction to graph theory. Vol. 2. Prentice hall Upper Saddle River, NJ."},{"key":"e_1_3_2_2_54_1","unstructured":"Guojun Wu Yanhua Li Jie Bao Yu Zheng Jieping Ye and Jun Luo. 2018. Human-centric urban transit evaluation and planning. In ICDM. 547--556.  Guojun Wu Yanhua Li Jie Bao Yu Zheng Jieping Ye and Jun Luo. 2018. Human-centric urban transit evaluation and planning. In ICDM. 547--556."},{"key":"e_1_3_2_2_55_1","article-title":"Natural connectivity of complex networks","volume":"27","author":"Wu Jun","year":"2010","unstructured":"Jun Wu , Barahona Mauricio , Yue Jin Tan , and Hong Zhong Deng . 2010 . Natural connectivity of complex networks . Chinese Physics Letters , Vol. 27 , 7 (2010). Jun Wu, Barahona Mauricio, Yue Jin Tan, and Hong Zhong Deng. 2010. Natural connectivity of complex networks . Chinese Physics Letters , Vol. 27, 7 (2010).","journal-title":"Chinese Physics Letters"},{"key":"e_1_3_2_2_56_1","doi-asserted-by":"crossref","unstructured":"Ping Zhang Zhifeng Bao Yuchen Li Guoliang Li Yipeng Zhang and Zhiyong Peng. 2018. Trajectory-driven influential billboard placement. In KDD. 2748--2757.  Ping Zhang Zhifeng Bao Yuchen Li Guoliang Li Yipeng Zhang and Zhiyong Peng. 2018. Trajectory-driven influential billboard placement. In KDD. 2748--2757.","DOI":"10.1145\/3219819.3219946"},{"key":"e_1_3_2_2_57_1","doi-asserted-by":"crossref","unstructured":"Yipeng Zhang Yuchen Li Zhifeng Bao Songsong Mo and Ping Zhang. 2019. Optimizing impression counts for outdoor advertising. In KDD . 1205--1215.  Yipeng Zhang Yuchen Li Zhifeng Bao Songsong Mo and Ping Zhang. 2019. Optimizing impression counts for outdoor advertising. In KDD . 1205--1215.","DOI":"10.1145\/3292500.3330829"},{"key":"e_1_3_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1108\/03684921311323644"}],"event":{"name":"SIGMOD\/PODS '21: International Conference on Management of Data","location":"Virtual Event China","acronym":"SIGMOD\/PODS '21","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2021 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3448016.3457247","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3448016.3457247","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:28:06Z","timestamp":1750195686000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3448016.3457247"}},"subtitle":["When Transit Network Connectivity Meets Commuting Demand"],"short-title":[],"issued":{"date-parts":[[2021,6,9]]},"references-count":57,"alternative-id":["10.1145\/3448016.3457247","10.1145\/3448016"],"URL":"https:\/\/doi.org\/10.1145\/3448016.3457247","relation":{},"subject":[],"published":{"date-parts":[[2021,6,9]]},"assertion":[{"value":"2021-06-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}