{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:45:03Z","timestamp":1743133503725,"version":"3.40.3"},"publisher-location":"Cham","reference-count":6,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319429014"},{"type":"electronic","value":"9783319429021"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-42902-1_30","type":"book-chapter","created":{"date-parts":[[2017,3,6]],"date-time":"2017-03-06T21:21:19Z","timestamp":1488835279000},"page":"225-230","source":"Crossref","is-referenced-by-count":0,"title":["Map Partitioning for Accelerated Routing: Measuring Relation Between Tiled and Routing Partitions"],"prefix":"10.1007","author":[{"given":"Maximilian","family":"Adam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Natalia","family":"Kliewer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Felix","family":"K\u00f6nig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,3,8]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Delling, D., Goldberg, A.V., Razenshteyn, I., Werneck, R.F.: Graph partitioning with natural cuts. In: 2011 IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp. 1135\u20131146. IEEE (2011)","DOI":"10.1109\/IPDPS.2011.108"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"Holtgrewe, M., Sanders, P., Schulz, C.: Engineering a scalable high quality graph partitioner. In: 2010 IEEE International Symposium on Parallel and Distributed Processing (IPDPS), pp. 1\u201312. IEEE (2010)","DOI":"10.1109\/IPDPS.2010.5470485"},{"issue":"1","key":"30_CR3","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1006\/jpdc.1997.1404","volume":"48","author":"G Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: Multilevelk-way partitioning scheme for irregular graphs. J. Parallel Distrib. Comput. 48(1), 96\u2013129 (1998)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"2","key":"30_CR4","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1137\/S0036144598334138","volume":"41","author":"G Karypis","year":"1999","unstructured":"Karypis, G., Kumar, V.: Parallel multilevel series k-way partitioning scheme for irregular graphs. SIAM Rev. 41(2), 278\u2013300 (1999)","journal-title":"SIAM Rev."},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"Pellegrini, F., Roman, J.: Scotch: a software package for static mapping by dual recursive bipartitioning of process and architecture graphs. In: High-performance Computing and Networking, pp. 493\u2013498. Springer, Heidelberg (1996)","DOI":"10.1007\/3-540-61142-8_588"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"Walshaw, C., Cross, M.: JOSTLE: parallel multilevel graph-partitioning software an overview. Mesh partitioning techniques and domain decomposition techniques, pp. 27\u201358 (2007)","DOI":"10.4203\/csets.17.2"}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2015"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-42902-1_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,19]],"date-time":"2019-09-19T06:49:03Z","timestamp":1568875743000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42902-1_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319429014","9783319429021"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42902-1_30","relation":{},"ISSN":["0721-5924","2197-9294"],"issn-type":[{"type":"print","value":"0721-5924"},{"type":"electronic","value":"2197-9294"}],"subject":[],"published":{"date-parts":[[2017]]}}}