{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T13:43:18Z","timestamp":1763646198933,"version":"3.45.0"},"reference-count":11,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,3,13]],"date-time":"2025-03-13T00:00:00Z","timestamp":1741824000000},"content-version":"vor","delay-in-days":71,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Procedia Computer Science"],"published-print":{"date-parts":[[2025]]},"DOI":"10.1016\/j.procs.2025.03.010","type":"journal-article","created":{"date-parts":[[2025,4,25]],"date-time":"2025-04-25T06:12:55Z","timestamp":1745561575000},"page":"53-59","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Customized Contraction Hierarchies with Flow-based Natural Cut Heuristic"],"prefix":"10.1016","volume":"257","author":[{"given":"Tatiana","family":"Babicheva","sequence":"first","affiliation":[]},{"given":"Dmitry","family":"Gushchin","sequence":"additional","affiliation":[]},{"given":"Grigoriy","family":"Simakov","sequence":"additional","affiliation":[]},{"given":"Yury","family":"Bychkov","sequence":"additional","affiliation":[]},{"given":"Edvard","family":"Olsen","sequence":"additional","affiliation":[]},{"given":"Egor","family":"Lazarevich","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.procs.2025.03.010_bib1","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1080\/0022250X.2001.9990249","article-title":"A faster algorithm for betweenness centrality","volume":"25","author":"Brandes","year":"2001","journal-title":"Journal of mathematical sociology"},{"key":"10.1016\/j.procs.2025.03.010_bib2","doi-asserted-by":"crossref","first-page":"2303","DOI":"10.1142\/S0218127407018403","article-title":"Centrality estimation in large networks","volume":"17","author":"Brandes","year":"2007","journal-title":"International Journal of Bifurcation and Chaos"},{"key":"10.1016\/j.procs.2025.03.010_bib3","doi-asserted-by":"crossref","unstructured":"Delling, D., Goldberg, A.V., Razenshteyn, I., Werneck, R.F., 2011. Graph partitioning with natural cuts, in: 2011 IEEE International Parallel & Distributed Processing Symposium, IEEE. pp. 1135\u20131146.","DOI":"10.1109\/IPDPS.2011.108"},{"key":"10.1016\/j.procs.2025.03.010_bib4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2886843","article-title":"Customizable contraction hierarchies","volume":"21","author":"Dibbelt","year":"2016","journal-title":"Journal of Experimental Algorithmics (JEA)"},{"key":"10.1016\/j.procs.2025.03.010_bib5","doi-asserted-by":"crossref","unstructured":"Gottesb\u00fcren, L., Hamann, M., Uhl, T.N., Wagner, D., 2019. Faster and better nested dissection orders for customizable contraction hierarchies. Algorithms 12, 196.","DOI":"10.3390\/a12090196"},{"key":"10.1016\/j.procs.2025.03.010_bib6","first-page":"1","article-title":"Graph bisection with pareto optimization","volume":"23","author":"Hamann","year":"2018","journal-title":"Journal of Experimental Algorithmics (JEA)"},{"key":"10.1016\/j.procs.2025.03.010_bib7","unstructured":"Hautekiet, O., 2021. Contraction hierarchies for efficient routing in networks: Impact of contraction order."},{"key":"10.1016\/j.procs.2025.03.010_bib8","unstructured":"Reijnders, B., et al., 2017. Pre-processing Road Networks for Graph Partitioning Using Edge-Betweenness Centrality. B.S. thesis."},{"key":"10.1016\/j.procs.2025.03.010_bib9","doi-asserted-by":"crossref","unstructured":"Sanders, P., Schulz, C., 2012. Distributed evolutionary graph partitioning, in: 2012 Proceedings of the fourteenth workshop on algorithm engineering and experiments (ALENEX), SIAM. pp. 16\u201329.","DOI":"10.1137\/1.9781611972924.2"},{"key":"10.1016\/j.procs.2025.03.010_bib10","doi-asserted-by":"crossref","unstructured":"Schild, A., Sommer, C., 2015. On balanced separators in road networks, in: International Symposium on Experimental Algorithms, Springer. pp. 286\u2013297.","DOI":"10.1007\/978-3-319-20086-6_22"},{"key":"10.1016\/j.procs.2025.03.010_bib11","unstructured":"Strasser, B., 2020. PACE Solver Description: Tree Depth with FlowCutter, in: Cao, Y., Pilipczuk, M. (Eds.), 15th International Symposium on Parameterized and Exact Computation (IPEC 2020), Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany. pp. 32:1\u201332:4. URL: https:\/\/drops.dagstuhl.de\/entities\/document\/10.4230\/LIPIcs.IPEC.2020.32, doi: 10.4230\/LIPIcs.IPEC.2020.32."}],"container-title":["Procedia Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S187705092500746X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S187705092500746X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T13:39:55Z","timestamp":1763645995000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S187705092500746X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":11,"alternative-id":["S187705092500746X"],"URL":"https:\/\/doi.org\/10.1016\/j.procs.2025.03.010","relation":{},"ISSN":["1877-0509"],"issn-type":[{"type":"print","value":"1877-0509"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Customized Contraction Hierarchies with Flow-based Natural Cut Heuristic","name":"articletitle","label":"Article Title"},{"value":"Procedia Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.procs.2025.03.010","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}