{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:12:05Z","timestamp":1742915525265,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":17,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387307701"},{"type":"electronic","value":"9780387301624"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_231","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:35:29Z","timestamp":1214505329000},"page":"519-522","source":"Crossref","is-referenced-by-count":1,"title":["Minimum Bisection"],"prefix":"10.1007","author":[{"given":"Robert","family":"Krauthgamer","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"1\u20132","key":"231_CR1_231","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-9260(95)00008-4","volume":"19","author":"C.J. Alpert","year":"1995","unstructured":"Alpert, C.J., Kahng, A.B.: Recent directions in netlist partitioning: a survey. Integr. VLSI J. 19(1\u20132), 1\u201381 (1995)","journal-title":"Integr. VLSI J."},{"key":"231_CR2_231","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, Chicago, June 2004","DOI":"10.1145\/1007352.1007355"},{"key":"231_CR3_231","unstructured":"Berman, P., Karpinski, M.: Approximability of hypergraph minimum bisection. ECCC Report TR03-056, Electronic Colloquium on Computational Complexity, vol. 10 (2003)"},{"issue":"3","key":"231_CR4_231","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0020-0190(92)90140-Q","volume":"42","author":"T.N. Bui","year":"1992","unstructured":"Bui, T.N., Jones, C.: Finding good approximate vertex and edge partitions is NP-hard. Inform. Process. Lett. 42(3), 153\u2013159 (1992)","journal-title":"Inform. Process. Lett."},{"issue":"1\u20133","key":"231_CR5_231","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2004.07.017","volume":"329","author":"A. Coja-Oghlan","year":"2004","unstructured":"Coja-Oghlan, A., Goerdt, A., Lanka, A., Sch\u00e4dlich, F.: Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2k-SAT. Theor. Comput. Sci. 329(1\u20133), 1\u201345 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"231_CR6_231","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1137\/050640904","volume":"48","author":"U. Feige","year":"2006","unstructured":"Feige, U., Krauthgamer, R.: A polylogarithmic approximation of the minimum bisection. SIAM Review 48(1), 99\u2013130 (2006) (Previous versions appeared in Proceedings of 41st FOCS, 1999; and in SIAM J.\u00a0Comput. 2002)","journal-title":"SIAM Review"},{"issue":"1","key":"231_CR7_231","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0020-0190(03)00251-5","volume":"87","author":"U. Feige","year":"2003","unstructured":"Feige, U., Yahalom, O.: On the complexity of finding balanced oneway cuts. Inf. Process. Lett. 87(1), 1\u20135 (2003)","journal-title":"Inf. Process. Lett."},{"key":"231_CR8_231","doi-asserted-by":"crossref","unstructured":"Feige, U.: Relations between average case complexity and approximation complexity. In: 34th Annual ACM Symposium on the Theory of Computing, pp. 534\u2013543, Montr\u00e9al, May 19\u201321, 2002","DOI":"10.1145\/509907.509985"},{"key":"231_CR9_231","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. W.H. Freeman and Company (1979)"},{"issue":"1","key":"231_CR10_231","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1145\/331605.331608","volume":"47","author":"D.R. Karger","year":"2000","unstructured":"Karger, D.R.: Minimum cuts in near-linear time. J.\u00a0ACM 47(1), 46\u201376 (2000)","journal-title":"J. ACM"},{"issue":"2","key":"231_CR11_231","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B.W. Kernighan","year":"1970","unstructured":"Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49(2), 291\u2013307 (1970)","journal-title":"Bell Syst. Tech. J."},{"key":"231_CR12_231","doi-asserted-by":"crossref","unstructured":"Khot, S.: Ruling out PTAS for graph Min-Bisection, Densest Subgraph and Bipartite Clique. In: 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 136\u2013145, Georgia Inst. of Technol., Atlanta 17\u201319 Oct. 2004","DOI":"10.1109\/FOCS.2004.59"},{"key":"231_CR13_231","doi-asserted-by":"crossref","unstructured":"Klein, P., Plotkin, S.A., Rao, S.: Excluded minors, network decomposition, and multicommodity flow. In: 25th Annual ACM Symposium on Theory of Computing, pp. 682\u2013690, San Diego, 1993 May 16\u201318","DOI":"10.1145\/167088.167261"},{"issue":"6","key":"231_CR14_231","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1145\/331524.331526","volume":"46","author":"T. Leighton","year":"1988","unstructured":"Leighton, T., Rao, S.: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J.\u00a0ACM 46(6), 787\u2013832, 29th FOCS, 1988 (1999)","journal-title":"J. ACM"},{"issue":"3","key":"231_CR15_231","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1137\/0209046","volume":"9","author":"R.J. Lipton","year":"1980","unstructured":"Lipton, R.J., Tarjan, R.E.: Applications of a planar separator theorem. SIAM J. Comput. 9(3), 615\u2013627 (1980)","journal-title":"SIAM J. Comput."},{"key":"231_CR16_231","volume-title":"Graph separators, with applications. Frontiers of Computer Science","author":"A.L. Rosenberg","year":"2001","unstructured":"Rosenberg, A.L., Heath, L.S.: Graph separators, with applications. Frontiers of Computer Science. Kluwer Academic\/Plenum Publishers, New York (2001)"},{"key":"231_CR17_231","doi-asserted-by":"crossref","unstructured":"Svitkina, Z., Tardos, \u00c9.: Min-Max multiway cut. In: 7th International workshop on Approximation algorithms for combinatorial optimization (APPROX), pp. 207\u2013218, Cambridge, 2004 August 22\u201324","DOI":"10.1007\/978-3-540-27821-4_19"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_231","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T21:32:25Z","timestamp":1738272745000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_231"}},"subtitle":["1999; Feige, Krauthgamer"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_231","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}