{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T00:01:31Z","timestamp":1752105691328,"version":"3.41.2"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,8,23]],"date-time":"2023-08-23T00:00:00Z","timestamp":1692748800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["SWIFT 2030249"],"award-info":[{"award-number":["SWIFT 2030249"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,8,23]]},"DOI":"10.1145\/3609956.3609977","type":"proceedings-article","created":{"date-parts":[[2023,8,24]],"date-time":"2023-08-24T21:45:50Z","timestamp":1692913550000},"page":"185-188","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["RouteDOC: Routing with Distance, Origin and Category Constraints (Demonstration Paper)"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-5231-383X","authenticated-orcid":false,"given":"Thomas","family":"Frohwein","sequence":"first","affiliation":[{"name":"Iowa State University, US"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-8342-5006","authenticated-orcid":false,"given":"Zachary","family":"Garwood","sequence":"additional","affiliation":[{"name":"Iowa State University, US"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-7436-9478","authenticated-orcid":false,"given":"Dylan","family":"Hampton","sequence":"additional","affiliation":[{"name":"Iowa State University, US"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-4149-2932","authenticated-orcid":false,"given":"Kevin","family":"Knack","sequence":"additional","affiliation":[{"name":"Iowa State University, US"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-8040-1954","authenticated-orcid":false,"given":"Nate","family":"Schenck","sequence":"additional","affiliation":[{"name":"Iowa State University, US"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-4809-9948","authenticated-orcid":false,"given":"Britney","family":"Yu","sequence":"additional","affiliation":[{"name":"Iowa State University, US"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-4123-4980","authenticated-orcid":false,"given":"Joe","family":"Zuber","sequence":"additional","affiliation":[{"name":"Iowa State University, US"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8839-6278","authenticated-orcid":false,"given":"Goce","family":"Trajcevski","sequence":"additional","affiliation":[{"name":"Iowa State University, US"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5169-1425","authenticated-orcid":false,"given":"Xu","family":"Teng","sequence":"additional","affiliation":[{"name":"Iowa State University, US"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7001-4123","authenticated-orcid":false,"given":"Andreas","family":"Z\u00fcfle","sequence":"additional","affiliation":[{"name":"Emory University, US"}]}],"member":"320","published-online":{"date-parts":[[2023,8,24]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"993","article-title":"Latent dirichlet allocation","author":"Blei M","year":"2003","unstructured":"David\u00a0M Blei, Andrew\u00a0Y Ng, and Michael\u00a0I Jordan. 2003. Latent dirichlet allocation. Journal of machine Learning research 3, Jan (2003), 993\u20131022.","journal-title":"Journal of machine Learning research 3"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1145\/3292390.3292394"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1109\/4236.612229"},{"key":"e_1_3_2_1_4_1","volume-title":"The web server gateway interface (wsgi). The Definitive Guide to Pylons","author":"Gardner James","year":"2009","unstructured":"James Gardner. 2009. The web server gateway interface (wsgi). The Definitive Guide to Pylons (2009), 369\u2013388."},{"volume-title":"Flask web development: developing web applications with python. \" O\u2019Reilly Media","author":"Grinberg Miguel","unstructured":"Miguel Grinberg. 2018. Flask web development: developing web applications with python. \" O\u2019Reilly Media, Inc.\".","key":"e_1_3_2_1_5_1"},{"volume-title":"The definitive guide to Django: Web development done right","author":"Holovaty Adrian","unstructured":"Adrian Holovaty and Jacob Kaplan-Moss. 2009. The definitive guide to Django: Web development done right. Apress.","key":"e_1_3_2_1_6_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1080\/17489725.2018.1508763"},{"key":"e_1_3_2_1_8_1","volume-title":"The traveling salesman problem: a guided tour of combinatorial optimization","author":"Lawler L","year":"1985","unstructured":"Eugene\u00a0L Lawler. 1985. The traveling salesman problem: a guided tour of combinatorial optimization. Wiley-Interscience Series in Discrete Mathematics (1985)."},{"key":"e_1_3_2_1_9_1","volume-title":"The Euclidean travelling salesman problem is NP-complete. Theoretical computer science 4, 3","author":"Papadimitriou H","year":"1977","unstructured":"Christos\u00a0H Papadimitriou. 1977. The Euclidean travelling salesman problem is NP-complete. Theoretical computer science 4, 3 (1977), 237\u2013244."},{"unstructured":"Michael\u00a0N Rice and Vassilis\u00a0J Tsotras. 2012. Exact graph search algorithms for generalized traveling salesman path problems. In SEA.","key":"e_1_3_2_1_10_1"},{"volume-title":"Location-based services","author":"Schiller Jochen","unstructured":"Jochen Schiller and Agn\u00e8s Voisard. 2004. Location-based services. Elsevier.","key":"e_1_3_2_1_11_1"},{"doi-asserted-by":"crossref","unstructured":"Xu Teng Goce Trajcevski and Andreas Z\u00fcfle. 2021. Semantically Diverse Paths with Range and Origin Constraints. In ACM SIGSPATIAL. 375\u2013378.","key":"e_1_3_2_1_12_1","DOI":"10.1145\/3474717.3483985"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1145\/3596601"},{"doi-asserted-by":"crossref","unstructured":"Xu Teng Jingchao Yang Joon-Seok Kim Goce Trajcevski Andreas Z\u00fcfle and Mario\u00a0A Nascimento. 2019. Fine-Grained Diversification of Proximity Constrained Queries on Road Networks. In SSTD.","key":"e_1_3_2_1_14_1","DOI":"10.1145\/3340964.3340970"}],"event":{"acronym":"SSTD '23","name":"SSTD '23: Symposium on Spatial and Temporal Data","location":"Calgary AB Canada"},"container-title":["Proceedings of the 18th International Symposium on Spatial and Temporal Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3609956.3609977","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3609956.3609977","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3609956.3609977","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,9]],"date-time":"2025-07-09T18:50:29Z","timestamp":1752087029000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3609956.3609977"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,23]]},"references-count":14,"alternative-id":["10.1145\/3609956.3609977","10.1145\/3609956"],"URL":"https:\/\/doi.org\/10.1145\/3609956.3609977","relation":{},"subject":[],"published":{"date-parts":[[2023,8,23]]},"assertion":[{"value":"2023-08-24","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}