{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:44:44Z","timestamp":1725795884356},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439470"},{"type":"electronic","value":"9783662439487"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43948-7_67","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T12:10:36Z","timestamp":1402488636000},"page":"812-822","source":"Crossref","is-referenced-by-count":3,"title":["Nonuniform Graph Partitioning with Unrelated Weights"],"prefix":"10.1007","author":[{"given":"Konstantin","family":"Makarychev","sequence":"first","affiliation":[]},{"given":"Yury","family":"Makarychev","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"67_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1007\/978-3-642-54423-1_51","volume-title":"LATIN 2014: Theoretical Informatics","author":"A. Amir","year":"2014","unstructured":"Amir, A., Ficler, J., Krauthgamer, R., Roditty, L., Sar Shalom, O.: Multiply Balanced k-Partitioning. In: Pardo, A., Viola, A. (eds.) LATIN 2014. LNCS, vol.\u00a08392, pp. 586\u2013597. Springer, Heidelberg (2014)"},{"key":"67_CR2","doi-asserted-by":"crossref","unstructured":"Bansal, N., Feige, U., Krauthgamer, R., Makarychev, K., Nagarajan, V., Naor, J., Schwartz, R.: Min-max Graph Partitioning and Small Set Expansion. In: FOCS 2011 (2011)","DOI":"10.1109\/FOCS.2011.79"},{"key":"67_CR3","doi-asserted-by":"crossref","unstructured":"Chlamtac, E., Makarychev, K., Makarychev, Y.: How to Play Unique Games Using Embeddings. In: FOCS 2006 (2006)","DOI":"10.1109\/FOCS.2006.36"},{"key":"67_CR4","doi-asserted-by":"crossref","unstructured":"Krauthgamer, R., Naor, J., Schwartz, R.: Partitioning graphs into balanced components. In: SODA 2009 (2009)","DOI":"10.1137\/1.9781611973068.102"},{"key":"67_CR5","doi-asserted-by":"crossref","unstructured":"Krauthgamer, R., Naor, J., Schwartz, R., Talwar, K.: Non-Uniform Graph Partitioning. In: SODA 2014 (2014)","DOI":"10.1137\/1.9781611973402.91"},{"key":"67_CR6","doi-asserted-by":"crossref","unstructured":"Louis, A., Makarychev, K.: Approximation Algorithm for Sparsest k-Partitioning. In: SODA 2014 (2014)","DOI":"10.1137\/1.9781611973402.92"},{"key":"67_CR7","doi-asserted-by":"crossref","unstructured":"Makarychev, K., Makarychev, Y.: Nonuniform Graph Partitioning with Unrelated Weights. arXiv:1401.0699 [cs.DS] (2014)","DOI":"10.1007\/978-3-662-43948-7_67"},{"key":"67_CR8","doi-asserted-by":"crossref","unstructured":"R\u00e4cke, H.: Optimal hierarchical decompositions for congestion minimization in networks. In: STOC 2008 (2008)","DOI":"10.1145\/1374376.1374415"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43948-7_67","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,11]],"date-time":"2019-08-11T08:41:34Z","timestamp":1565512894000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43948-7_67"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439470","9783662439487"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43948-7_67","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}