{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:33:36Z","timestamp":1750221216237,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":51,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,8,13]],"date-time":"2018-08-13T00:00:00Z","timestamp":1534118400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100002347","name":"Bundesministerium f\u00fcr Bildung und Forschung","doi-asserted-by":"publisher","award":["01|H15004B"],"award-info":[{"award-number":["01|H15004B"]}],"id":[{"id":"10.13039\/501100002347","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["ME 3619\/2-1"],"award-info":[{"award-number":["ME 3619\/2-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,8,13]]},"DOI":"10.1145\/3225058.3225148","type":"proceedings-article","created":{"date-parts":[[2018,8,8]],"date-time":"2018-08-08T19:13:06Z","timestamp":1533755586000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Balanced k-means for Parallel Geometric Partitioning"],"prefix":"10.1145","author":[{"given":"Moritz","family":"von Looz","sequence":"first","affiliation":[{"name":"University of Cologne, Institute of Computer Science, Cologne, Germany"}]},{"given":"Charilaos","family":"Tzovas","sequence":"additional","affiliation":[{"name":"University of Cologne, Institute of Computer Science, Cologne, Germany"}]},{"given":"Henning","family":"Meyerhenke","sequence":"additional","affiliation":[{"name":"University of Cologne, Institute of Computer Science, Cologne, Germany"}]}],"member":"320","published-online":{"date-parts":[[2018,8,13]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics, 1027--1035","author":"Arthur David","year":"2007","unstructured":"David Arthur and Sergei Vassilvitskii . 2007 . k-means++: The advantages of careful seeding . In Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics, 1027--1035 . David Arthur and Sergei Vassilvitskii. 2007. k-means++: The advantages of careful seeding. In Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics, 1027--1035."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0031-3203(84)90064-5"},{"key":"e_1_3_2_1_3_1","volume-title":"Proc. 32nd International Parallel and Distributed Processing Symp. (IPDPS","author":"Axtmann M.","year":"2018","unstructured":"M. Axtmann , A. Wiebigke , and P. Sanders . 2018. Lightweight MPI Communicators with Applications to Perfectly Balanced Schizophrenic Quicksort . In Proc. 32nd International Parallel and Distributed Processing Symp. (IPDPS 2018 ). To appear. M. Axtmann, A. Wiebigke, and P. Sanders. 2018. Lightweight MPI Communicators with Applications to Perfectly Balanced Schizophrenic Quicksort. In Proc. 32nd International Parallel and Distributed Processing Symp. (IPDPS 2018). To appear."},{"key":"e_1_3_2_1_4_1","unstructured":"Olivier Bachem Mario Lucic Hamed Hassani and Andreas Krause. 2016. Fast and provably good seedings for k-means. In Advances in Neural Information Processing Systems. 55--63.   Olivier Bachem Mario Lucic Hamed Hassani and Andreas Krause. 2016. Fast and provably good seedings for k-means. In Advances in Neural Information Processing Systems. 55--63."},{"key":"e_1_3_2_1_5_1","volume-title":"Proc. of the 10th DIMACS Implementation Challenge. American Mathematical Society.","author":"Bader David","year":"2012","unstructured":"David Bader , Henning Meyerhenke , Peter Sanders , and Dorothea Wagner ( Eds .). 2012 . Proc. of the 10th DIMACS Implementation Challenge. American Mathematical Society. David Bader, Henning Meyerhenke, Peter Sanders, and Dorothea Wagner (Eds.). 2012. Proc. of the 10th DIMACS Implementation Challenge. American Mathematical Society."},{"volume-title":"Space-Filling Curves: An Introduction with Applications in Scientific Computing","author":"Bader Michael","key":"e_1_3_2_1_6_1","unstructured":"Michael Bader . 2012. Space-Filling Curves: An Introduction with Applications in Scientific Computing . Springer Publishing Company, Inc. Michael Bader. 2012. Space-Filling Curves: An Introduction with Applications in Scientific Computing. Springer Publishing Company, Inc."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1987.1676942"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"C.E. Bichot and P. Siarry. 2013. Graph Partitioning. Wiley.  C.E. Bichot and P. Siarry. 2013. Graph Partitioning. Wiley.","DOI":"10.1002\/9781118601181"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1155\/2012\/713587"},{"key":"e_1_3_2_1_10_1","volume-title":"A balanced k-means algorithm for weighted point sets. arXiv preprint arXiv:1308.4004","author":"Borgwardt Steffen","year":"2013","unstructured":"Steffen Borgwardt , Andreas Brieden , and Peter Gritzmann . 2013. A balanced k-means algorithm for weighted point sets. arXiv preprint arXiv:1308.4004 ( 2013 ). Steffen Borgwardt, Andreas Brieden, and Peter Gritzmann. 2013. A balanced k-means algorithm for weighted point sets. arXiv preprint arXiv:1308.4004 (2013)."},{"key":"e_1_3_2_1_11_1","volume-title":"The LAMA Approach for Writing Portable Applications on Heterogeneous Architectures","author":"Brandes Thomas","year":"1962","unstructured":"Thomas Brandes , Eric Schricker , and Thomas Soddemann . 2017. The LAMA Approach for Writing Portable Applications on Heterogeneous Architectures . Springer Berlin Heidelberg . http:\/\/www.springer.com\/de\/book\/97833 1962 4570 Thomas Brandes, Eric Schricker, and Thomas Soddemann. 2017. The LAMA Approach for Writing Portable Applications on Heterogeneous Architectures. Springer Berlin Heidelberg. http:\/\/www.springer.com\/de\/book\/9783319624570"},{"key":"e_1_3_2_1_12_1","series-title":"Lecture Notes in Computer Science","volume-title":"Algorithm Engineering - Selected Results and Surveys, Lasse Kliemann and Peter Sanders (Eds.)","author":"Bulu\u00e7 Aydin","unstructured":"Aydin Bulu\u00e7 , Henning Meyerhenke , Ilya Safro , Peter Sanders , and Christian Schulz . 2016. Recent Advances in Graph Partitioning . In Algorithm Engineering - Selected Results and Surveys, Lasse Kliemann and Peter Sanders (Eds.) . Lecture Notes in Computer Science , Vol. 9220 . 117--158. Aydin Bulu\u00e7, Henning Meyerhenke, Ilya Safro, Peter Sanders, and Christian Schulz. 2016. Recent Advances in Graph Partitioning. In Algorithm Engineering - Selected Results and Surveys, Lasse Kliemann and Peter Sanders (Eds.). Lecture Notes in Computer Science, Vol. 9220. 117--158."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.09.018"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5194\/gmd-10-765-2017"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2015.2412545"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(00)00043-0"},{"key":"e_1_3_2_1_17_1","volume-title":"5th NIPS workshop on optimization for machine learning. 42--53","author":"Drake Jonathan","year":"2012","unstructured":"Jonathan Drake and Greg Hamerly . 2012 . Accelerated k-means with adaptive distance bounds . In 5th NIPS workshop on optimization for machine learning. 42--53 . Jonathan Drake and Greg Hamerly. 2012. Accelerated k-means with adaptive distance bounds. In 5th NIPS workshop on optimization for machine learning. 42--53."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1961.10482090"},{"key":"e_1_3_2_1_19_1","volume-title":"Proceedings of the 20th International Conference on Machine Learning (ICML-03)","author":"Elkan Charles","year":"2003","unstructured":"Charles Elkan . 2003 . Using the triangle inequality to accelerate k-means . In Proceedings of the 20th International Conference on Machine Learning (ICML-03) . 147--153. Charles Elkan. 2003. Using the triangle inequality to accelerate k-means. In Proceedings of the 20th International Conference on Machine Learning (ICML-03). 147--153."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcp.2016.11.016"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2018.00043"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972801.12"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(00)00048-X"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/0916028"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2010.5470485"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/645459.654082"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2503210.2503280"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056489"},{"volume-title":"An Efficient Parallel Load-Balancing Framework for Orthogonal Decomposition of Geometrical Data","author":"Magalh\u00e3es Bruno R. C.","key":"e_1_3_2_1_29_1","unstructured":"Bruno R. C. Magalh\u00e3es , Farhan Tauheed , Thomas Heinis , Anastasia Ailamaki , and Felix Sch\u00fcrmann . 2016. An Efficient Parallel Load-Balancing Framework for Orthogonal Decomposition of Geometrical Data . Springer International Publishing , Cham , 81--97. Bruno R. C. Magalh\u00e3es, Farhan Tauheed, Thomas Heinis, Anastasia Ailamaki, and Felix Sch\u00fcrmann. 2016. An Efficient Parallel Load-Balancing Framework for Orthogonal Decomposition of Geometrical Data. Springer International Publishing, Cham, 81--97."},{"volume-title":"Proc. of the International Conference on Parallel and Distributed Processing Techniques and Applications, (PDPTA'05)","author":"Marquardt O.","key":"e_1_3_2_1_30_1","unstructured":"O. Marquardt and S. Schamberger . 2005. Open Benchmarks for Load Balancing Heuristics in Parallel Adaptive Finite Element Computations . In Proc. of the International Conference on Parallel and Distributed Processing Techniques and Applications, (PDPTA'05) . CSREA Press, 685--691. O. Marquardt and S. Schamberger. 2005. Open Benchmarks for Load Balancing Heuristics in Parallel Adaptive Finite Element Computations. In Proc. of the International Conference on Parallel and Distributed Processing Techniques and Applications, (PDPTA'05). CSREA Press, 685--691."},{"volume-title":"Proc. of the 10th DIMACS Implementation Challenge -- Graph Partitioning and Graph Clustering (Contemporary Mathematics), David A","author":"Meyerhenke Henning","key":"e_1_3_2_1_31_1","unstructured":"Henning Meyerhenke . 2013. Shape Optimizing Load Balancing for MPI-Parallel Adaptive Numerical Simulations . In Proc. of the 10th DIMACS Implementation Challenge -- Graph Partitioning and Graph Clustering (Contemporary Mathematics), David A . Bader, Henning Meyerhenke, Peter Sanders, and Dorothea Wagner (Eds.). American Mathematical Society . Henning Meyerhenke. 2013. Shape Optimizing Load Balancing for MPI-Parallel Adaptive Numerical Simulations. In Proc. of the 10th DIMACS Implementation Challenge -- Graph Partitioning and Graph Clustering (Contemporary Mathematics), David A. Bader, Henning Meyerhenke, Peter Sanders, and Dorothea Wagner (Eds.). American Mathematical Society."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2009.04.005"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2009.09.006"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2017.2671868"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9666-y"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/11823285_24"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"K. W. Morton and D. F. Mayers. 2005. Numerical Solution of Partial Differential Equations: An Introduction. Cambridge University Press New York NY USA.   K. W. Morton and D. F. Mayers. 2005. Numerical Solution of Partial Differential Equations: An Introduction. Cambridge University Press New York NY USA.","DOI":"10.1017\/CBO9780511812248"},{"volume-title":"Scotch and PT-Scotch Graph Partitioning Software: An Overview","author":"Pellegrini Fran\u00e7ois","key":"e_1_3_2_1_38_1","unstructured":"Fran\u00e7ois Pellegrini . 2012. Scotch and PT-Scotch Graph Partitioning Software: An Overview . In Combinatorial Scientific Computing, Uwe Naumann and Olaf Schenk (Eds.). CRC Press , 373--406. Fran\u00e7ois Pellegrini. 2012. Scotch and PT-Scotch Graph Partitioning Software: An Overview. In Combinatorial Scientific Computing, Uwe Naumann and Olaf Schenk (Eds.). CRC Press, 373--406."},{"volume-title":"Unified European Applications Benchmark Suite. (2016)","author":"PRACE.","key":"e_1_3_2_1_39_1","unstructured":"PRACE. 2016. Unified European Applications Benchmark Suite. (2016) . http:\/\/www.prace-ri.eu\/ueabs?lang=en Accessed: 2017-09-30. PRACE. 2016. Unified European Applications Benchmark Suite. (2016). http:\/\/www.prace-ri.eu\/ueabs?lang=en Accessed: 2017-09-30."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.7717\/peerj-cs.55"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/180\/1\/012045"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.605"},{"key":"e_1_3_2_1_43_1","unstructured":"K. Schloegel G. Karypis and V. Kumar. 2003. Graph Partitioning for High Performance Scientific Simulations. In The Sourcebook of Parallel Computing. Morgan Kaufmann 491--541.   K. Schloegel G. Karypis and V. Kumar. 2003. Graph Partitioning for High Performance Scientific Simulations. In The Sourcebook of Parallel Computing. Morgan Kaufmann 491--541."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772862"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/0956-0521(91)90014-V"},{"key":"e_1_3_2_1_46_1","volume-title":"Proc. 31st International Parallel and Distributed Processing Symp. (IPDPS","author":"Slota G. M.","year":"2017","unstructured":"G. M. Slota , S. Rajamanickam , Karen Devine , and K. Madduri . 2017. Partitioning Trillion-edge Graphs in Minutes . In Proc. 31st International Parallel and Distributed Processing Symp. (IPDPS 2017 ). G. M. Slota, S. Rajamanickam, Karen Devine, and K. Madduri. 2017. Partitioning Trillion-edge Graphs in Minutes. In Proc. 31st International Parallel and Distributed Processing Symp. (IPDPS 2017)."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1002\/nme.1620372205"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"crossref","unstructured":"M. von Looz C. Tzovas and H. Meyerhenke. 2018. Balanced k-means for Parallel Geometric Partitioning. ArXiv e-prints (May 2018). arXiv:cs.DC\/1805.01208  M. von Looz C. Tzovas and H. Meyerhenke. 2018. Balanced k-means for Parallel Geometric Partitioning. ArXiv e-prints (May 2018). arXiv:cs.DC\/1805.01208","DOI":"10.1145\/3225058.3225148"},{"key":"e_1_3_2_1_49_1","volume-title":"JOSTLE: Parallel Multilevel Graph-Partitioning Software -- An Overview","author":"Walshaw C.","year":"2007","unstructured":"C. Walshaw and M. Cross . 2007 . JOSTLE: Parallel Multilevel Graph-Partitioning Software -- An Overview . In Mesh Partitioning Techniques and Domain Decomposition Techniques, F. Magoules (Ed.). Civil-Comp Ltd ., 27--58. (Invited chapter). C. Walshaw and M. Cross. 2007. JOSTLE: Parallel Multilevel Graph-Partitioning Software -- An Overview. In Mesh Partitioning Techniques and Domain Decomposition Techniques, F. Magoules (Ed.). Civil-Comp Ltd., 27--58. (Invited chapter)."},{"key":"e_1_3_2_1_50_1","volume-title":"Individual comparisons by ranking methods. Biometrics bulletin 1, 6","author":"Wilcoxon Frank","year":"1945","unstructured":"Frank Wilcoxon . 1945. Individual comparisons by ranking methods. Biometrics bulletin 1, 6 ( 1945 ), 80--83. Frank Wilcoxon. 1945. Individual comparisons by ranking methods. Biometrics bulletin 1, 6 (1945), 80--83."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.4330030502"}],"event":{"name":"ICPP 2018: 47th International Conference on Parallel Processing","sponsor":["University of Oregon University of Oregon"],"location":"Eugene OR USA","acronym":"ICPP 2018"},"container-title":["Proceedings of the 47th International Conference on Parallel Processing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3225058.3225148","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3225058.3225148","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:39:50Z","timestamp":1750210790000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3225058.3225148"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,13]]},"references-count":51,"alternative-id":["10.1145\/3225058.3225148","10.1145\/3225058"],"URL":"https:\/\/doi.org\/10.1145\/3225058.3225148","relation":{},"subject":[],"published":{"date-parts":[[2018,8,13]]},"assertion":[{"value":"2018-08-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}