{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T15:52:05Z","timestamp":1759938725975,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642544224"},{"type":"electronic","value":"9783642544231"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54423-1_51","type":"book-chapter","created":{"date-parts":[[2014,3,25]],"date-time":"2014-03-25T03:02:27Z","timestamp":1395716547000},"page":"586-597","source":"Crossref","is-referenced-by-count":5,"title":["Multiply Balanced k\u2009\u2212Partitioning"],"prefix":"10.1007","author":[{"given":"Amihood","family":"Amir","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jessica","family":"Ficler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Krauthgamer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liam","family":"Roditty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oren","family":"Sar Shalom","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"51_CR1","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1007\/s00224-006-1350-7","volume":"39","author":"K. Andreev","year":"2006","unstructured":"Andreev, K., Racke, H.: Balanced graph partitioning. Theory of Computing Systems\u00a039(6), 929\u2013939 (2006)","journal-title":"Theory of Computing Systems"},{"key":"51_CR2","doi-asserted-by":"crossref","unstructured":"Arora, S., Rao, S., Vazirani, U.: Expander flows, geometric embeddings, and graph partitionings. In: 36th Annual Symposium on the Theory of Computing, pp. 222\u2013231 (May 2004)","DOI":"10.1145\/1007352.1007355"},{"issue":"4","key":"51_CR3","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1137\/S0097539799356265","volume":"33","author":"C. Chekuri","year":"2004","unstructured":"Chekuri, C., Khanna, S.: On multidimensional packing problems. SIAM Journal on Computing\u00a033(4), 837\u2013851 (2004)","journal-title":"SIAM Journal on Computing"},{"key":"51_CR4","first-page":"639","volume-title":"Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"G. Even","year":"1997","unstructured":"Even, G., Naor, J., Rao, S., Schieber, B.: Fast approximate graph partitioning algorithms. In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 639\u2013648. ACM, New York (1997)"},{"issue":"4","key":"51_CR5","doi-asserted-by":"publisher","first-page":"1090","DOI":"10.1137\/S0097539701387660","volume":"31","author":"U. Feige","year":"2002","unstructured":"Feige, U., Krauthgamer, R.: A polylogarithmic approximation of the minimum bisection. SIAM J. Comput.\u00a031(4), 1090\u20131118 (2002)","journal-title":"SIAM J. Comput."},{"key":"51_CR6","first-page":"100","volume-title":"29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)","author":"A.E. Feldmann","year":"2012","unstructured":"Feldmann, A.E., Foschini, L.: Balanced partitions of trees and applications. In: 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012), vol.\u00a014, pp. 100\u2013111. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl (2012)"},{"issue":"3","key":"51_CR7","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete graph problems. Theoret. Comput. Sci.\u00a01(3), 237\u2013267 (1976)","journal-title":"Theoret. Comput. Sci."},{"key":"51_CR8","unstructured":"Garofalakis, M.N., Ioannidis, Y.E.: Parallel query scheduling and optimization with time-and space-shared resources. SORT\u00a01(T2), T3 (1997)"},{"key":"51_CR9","first-page":"28","volume":"95","author":"B. Hendrickson","year":"1995","unstructured":"Hendrickson, B., Leland, R.W.: A multi-level algorithm for partitioning graphs. SC\u00a095, 28 (1995)","journal-title":"SC"},{"issue":"1","key":"51_CR10","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G. Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput.\u00a020(1), 359\u2013392 (1998)","journal-title":"SIAM J. Sci. Comput."},{"key":"51_CR11","doi-asserted-by":"crossref","unstructured":"Krauthgamer, R., Naor, J.S., Schwartz, R.: Partitioning graphs into balanced components. In: 20th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 942\u2013949. SIAM (2009)","DOI":"10.1137\/1.9781611973068.102"},{"key":"51_CR12","doi-asserted-by":"crossref","unstructured":"Leighton, F., Makedon, F., Tragoudas, S.: Approximation algorithms for VLSI partition problems. In: Proceedings of the IEEE International Symposium on Circuits and Systems, pp. 2865\u20132868. IEEE Computer Society Press (1990)","DOI":"10.1109\/ISCAS.1990.112608"},{"issue":"6","key":"51_CR13","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1145\/331524.331526","volume":"46","author":"T. Leighton","year":"1999","unstructured":"Leighton, T., Rao, S.: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM\u00a046(6), 787\u2013832 (1999)","journal-title":"J. ACM"},{"key":"51_CR14","unstructured":"MacGregor, R.: On Partitioning a Graph: A Theoretical and Empirical Study. Memorandum UCB\/ERL-M. University of California, Berkeley (1978)"},{"key":"51_CR15","doi-asserted-by":"crossref","unstructured":"Patkar, S.B., Narayanan, H.: An efficient practical heuristic for good ratio-cut partitioning. In: 16th International Conference on VLSI Design, pp. 64\u201369. IEEE (2003)","DOI":"10.1109\/ICVD.2003.1183116"},{"key":"51_CR16","unstructured":"Portugal, D., Rocha, R.: Partitioning generic graphs into k regions. In: 6th Iberian Congress on Numerical Methods in Engineering (CMNE 2011), Coimbra, Portugal (June 2011)"},{"key":"51_CR17","doi-asserted-by":"crossref","unstructured":"R\u00e4cke, H.: Optimal hierarchical decompositions for congestion minimization in networks. In: 40th Annual ACM Symposium on Theory of Computing, pp. 255\u2013264. ACM (2008)","DOI":"10.1145\/1374376.1374415"},{"issue":"5","key":"51_CR18","doi-asserted-by":"publisher","first-page":"1436","DOI":"10.1137\/S1064827593255135","volume":"18","author":"H.D. Simon","year":"1997","unstructured":"Simon, H.D., Teng, S.: How good is recursive bisection? SIAM J. Sci. Comput.\u00a018(5), 1436\u20131445 (1997)","journal-title":"SIAM J. Sci. Comput."}],"container-title":["Lecture Notes in Computer Science","LATIN 2014: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54423-1_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T04:23:15Z","timestamp":1746159795000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54423-1_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642544224","9783642544231"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54423-1_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}