{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,14]],"date-time":"2025-01-14T14:10:01Z","timestamp":1736863801254,"version":"3.33.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,1,14]],"date-time":"2025-01-14T00:00:00Z","timestamp":1736812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,1,14]],"date-time":"2025-01-14T00:00:00Z","timestamp":1736812800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"name":"National Police Artificial Intelligence Lab of the Netherlands"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Netw Sci"],"DOI":"10.1007\/s41109-024-00689-1","type":"journal-article","created":{"date-parts":[[2025,1,14]],"date-time":"2025-01-14T13:28:20Z","timestamp":1736861300000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Graph coarsening for fugitive interception"],"prefix":"10.1007","volume":"10","author":[{"given":"Irene S.","family":"van Droffelaar","sequence":"first","affiliation":[]},{"given":"Jan H.","family":"Kwakkel","sequence":"additional","affiliation":[]},{"given":"Jelte P.","family":"Mense","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Verbraeck","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,14]]},"reference":[{"issue":"2","key":"689_CR1","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0022-0000(83)90012-0","volume":"26","author":"T Asano","year":"1983","unstructured":"Asano T, Hirata T (1983) Edge-contraction problems. J Comput Syst Sci 26(2):197\u2013208. https:\/\/doi.org\/10.1016\/0022-0000(83)90012-0","journal-title":"J Comput Syst Sci"},{"key":"689_CR2","first-page":"5","volume":"59","author":"B Alspach","year":"2004","unstructured":"Alspach B (2004) Searching and sweeping graphs: a brief survey. Le Mat 59:5\u201337","journal-title":"Le Mat"},{"issue":"3","key":"689_CR3","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1287\/trsc.26.3.201","volume":"26","author":"O Berman","year":"1992","unstructured":"Berman O, Larson RC, Fouska N (1992) Optimal location of discretionary service facilities. Transp Sci 26(3):201\u2013211. https:\/\/doi.org\/10.1287\/trsc.26.3.201","journal-title":"Transp Sci"},{"key":"689_CR4","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.compenvurbsys.2017.05.004","volume":"65","author":"G Boeing","year":"2017","unstructured":"Boeing G (2017) Osmnx: new methods for acquiring, constructing, analyzing, and visualizing complex street networks. Comput Environ Urban Syst 65:126\u2013139. https:\/\/doi.org\/10.1016\/j.compenvurbsys.2017.05.004","journal-title":"Comput Environ Urban Syst"},{"key":"689_CR5","unstructured":"Boeing G (2024) Modeling and analyzing urban networks and amenities with OSMnx. https:\/\/geoffboeing.com\/publications\/osmnx-paper\/"},{"key":"689_CR6","doi-asserted-by":"publisher","first-page":"2257","DOI":"10.1029\/2018WR023133","volume":"55","author":"F Bode","year":"2019","unstructured":"Bode F, Reed PM, Reuschen S, Nowak W (2019) Search space representation and reduction methods to enhance multiobjective water supply monitoring design. Water Resour Res 55:2257\u20132278. https:\/\/doi.org\/10.1029\/2018WR023133","journal-title":"Water Resour Res"},{"issue":"1","key":"689_CR7","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s10852-008-9098-5","volume":"8","author":"M Boccia","year":"2009","unstructured":"Boccia M, Sforza A, Sterle C (2009) Flow intercepting facility location: problems, models and heuristics. J Math Model Algorithms 8(1):35\u201379. https:\/\/doi.org\/10.1007\/s10852-008-9098-5","journal-title":"J Math Model Algorithms"},{"key":"689_CR8","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s10514-011-9255-y","volume":"31","author":"R Borie","year":"2011","unstructured":"Borie R, Tovey C, Koenig S (2011) Algorithms and complexity results for graph-based pursuit evasion. Auton Robot 31:317\u2013332. https:\/\/doi.org\/10.1007\/s10514-011-9255-y","journal-title":"Auton Robot"},{"issue":"4","key":"689_CR9","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s10514-011-9241-4","volume":"31","author":"TH Chung","year":"2011","unstructured":"Chung TH, Hollinger GA, Isler V (2011) Search and pursuit-evasion in mobile robotics: a survey. Auton Robot 31(4):299\u2013316. https:\/\/doi.org\/10.1007\/s10514-011-9241-4","journal-title":"Auton Robot"},{"key":"689_CR10","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-642-11169-3_14","volume-title":"Learning and intelligent optimization","author":"C Chevalier","year":"2009","unstructured":"Chevalier C, Safro I (2009) Comparison of coarsening schemes for multilevel graph partitioning. Learning and intelligent optimization. Springer, Berlin, Heidelberg, pp 191\u2013205. https:\/\/doi.org\/10.1007\/978-3-642-11169-3_14"},{"key":"689_CR11","unstructured":"Delft High Performance Computing Centre (2022) DelftBlue supercomputer (phase 1). https:\/\/www.tudelft.nl\/dhpc\/ark\/delftbluephase1"},{"key":"689_CR12","doi-asserted-by":"publisher","unstructured":"Geisberger R, Sanders P, Schultes D, Delling D (2008) Contraction hierarchies: faster and simpler hierarchical routing in road networks. In: International workshop on experimental and efficient algorithms, pp 319\u2013333. https:\/\/doi.org\/10.1007\/978-3-540-68552-4_24","DOI":"10.1007\/978-3-540-68552-4_24"},{"key":"689_CR13","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1111\/j.1538-4632.1990.tb00210.x","volume":"22","author":"MJ Hodgson","year":"1990","unstructured":"Hodgson MJ (1990) A flow-capturing location-allocation model. Geogr Anal 22:270\u2013279. https:\/\/doi.org\/10.1111\/j.1538-4632.1990.tb00210.x","journal-title":"Geogr Anal"},{"issue":"2","key":"689_CR14","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1162\/EVCO_a_00075","volume":"21","author":"D Hadka","year":"2013","unstructured":"Hadka D, Reed P (2013) Borg: an auto-adaptive many-objective evolutionary computing framework. Evol Comput 21(2):231\u2013259. https:\/\/doi.org\/10.1162\/EVCO_a_00075","journal-title":"Evol Comput"},{"issue":"6","key":"689_CR15","doi-asserted-by":"publisher","first-page":"2240","DOI":"10.1109\/TITS.2019.2912430","volume":"21","author":"P Krishnakumari","year":"2020","unstructured":"Krishnakumari P, Cats O, Lint H (2020) Heuristic coarsening for generating multiscale transport networks. IEEE Trans Intell Transp Syst 21(6):2240\u20132253. https:\/\/doi.org\/10.1109\/TITS.2019.2912430","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"689_CR16","unstructured":"Koester RJ (2008) Lost person behavior: a search and rescue guide on where to look for land, air, and water. DbS Productions, Charlottesville, VA, United States"},{"issue":"116","key":"689_CR17","first-page":"1","volume":"20","author":"A Loukas","year":"2019","unstructured":"Loukas A (2019) Graph reduction with spectral and cut guarantees. J Mach Learn Res 20(116):1\u201342","journal-title":"J Mach Learn Res"},{"issue":"1","key":"689_CR18","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s41109-022-00521-8","volume":"7","author":"J Pung","year":"2022","unstructured":"Pung J, D\u2019Souza RM, Ghosal D, Zhang M (2022) A road network simplification algorithm that preserves topological properties. Appl Netw Sci 7(1):79. https:\/\/doi.org\/10.1007\/s41109-022-00521-8","journal-title":"Appl Netw Sci"},{"issue":"1","key":"689_CR19","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1002\/jgt.3190130114","volume":"13","author":"D Peleg","year":"1989","unstructured":"Peleg D, Sch\u00e4ffer AA (1989) Graph spanners. J Graph Theory 13(1):99\u2013116. https:\/\/doi.org\/10.1002\/jgt.3190130114","journal-title":"J Graph Theory"},{"key":"689_CR20","unstructured":"Ralphs T (2022) CBC: COIN-OR branch-and-cut solver. Version 2.10.8. https:\/\/github.com\/coin-or\/Cbc"},{"key":"689_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2133803.2330080","volume":"17","author":"P Sanders","year":"2012","unstructured":"Sanders P, Schultes D (2012) Engineering highway hierarchies. J Exp Algorithmics 17:1. https:\/\/doi.org\/10.1145\/2133803.2330080","journal-title":"J Exp Algorithmics"},{"key":"689_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2670338","volume":"19","author":"I Safro","year":"2015","unstructured":"Safro I, Sanders P, Schulz C (2015) Advanced coarsening schemes for graph partitioning. J Exp Algorithmics 19:1\u201324. https:\/\/doi.org\/10.1145\/2670338","journal-title":"J Exp Algorithmics"},{"key":"689_CR23","unstructured":"van Droffelaar IS, Kwakkel JH, Mense JP, Verbraeck A (2024) The effect of models of fugitive behavior on police interception strategies. In: Advances in social simulation. ESSA 2024. Springer proceedings in complexity. Springer, Switzerland"},{"key":"689_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.simpat.2024.102923","author":"IS van Droffelaar","year":"2024","unstructured":"van Droffelaar IS, Kwakkel JH, Mense JP, Verbraeck A (2024) Simulation-optimization configurations for real-time decision-making in fugitive interception. Simul Model Pract Theory. https:\/\/doi.org\/10.1016\/j.simpat.2024.102923","journal-title":"Simul Model Pract Theory"},{"key":"689_CR25","doi-asserted-by":"publisher","first-page":"862","DOI":"10.1287\/opre.50.5.862.373","volume":"50","author":"C Walshaw","year":"2004","unstructured":"Walshaw C (2004) A multilevel approach to the travelling salesman problem. Oper Res 50:862. https:\/\/doi.org\/10.1287\/opre.50.5.862.373","journal-title":"Oper Res"}],"container-title":["Applied Network Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-024-00689-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41109-024-00689-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-024-00689-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,14]],"date-time":"2025-01-14T13:28:25Z","timestamp":1736861305000},"score":1,"resource":{"primary":{"URL":"https:\/\/appliednetsci.springeropen.com\/articles\/10.1007\/s41109-024-00689-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,14]]},"references-count":25,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["689"],"URL":"https:\/\/doi.org\/10.1007\/s41109-024-00689-1","relation":{},"ISSN":["2364-8228"],"issn-type":[{"value":"2364-8228","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,14]]},"assertion":[{"value":"24 October 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 December 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 January 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"2"}}