{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:55:03Z","timestamp":1725512103404},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540792277"},{"type":"electronic","value":"9783540792284"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-79228-4_24","type":"book-chapter","created":{"date-parts":[[2008,4,29]],"date-time":"2008-04-29T01:07:56Z","timestamp":1209431276000},"page":"270-281","source":"Crossref","is-referenced-by-count":3,"title":["Finding Minimum 3-Way Cuts in Hypergraphs"],"prefix":"10.1007","author":[{"given":"Mingyu","family":"Xiao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"24_CR1","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/S0167-6377(97)00043-6","volume":"21","author":"M. Burlet","year":"1997","unstructured":"Burlet, M., Goldschmidt, O.: A new and improved algorithm for the 3-cut problem. Operations Research Letters\u00a021(5), 225\u2013227 (1997)","journal-title":"Operations Research Letters"},{"issue":"3","key":"24_CR2","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1002\/(SICI)1097-0037(199910)34:3<215::AID-NET6>3.0.CO;2-E","volume":"34","author":"R.F. Easley","year":"1999","unstructured":"Easley, R.F., Hartvigsen, D.: Crossing properties of multiterminal cuts. Networks\u00a034(3), 215\u2013220 (1999)","journal-title":"Networks"},{"issue":"5","key":"24_CR3","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1145\/290179.290181","volume":"45","author":"A.V. Goldberg","year":"1998","unstructured":"Goldberg, A.V., Rao, S.: Beyond the flow decomposition barrier. J. ACM.\u00a045(5), 783\u2013797 (1998): A preliminary version appeared in FOCS 1997","journal-title":"J. ACM."},{"issue":"4","key":"24_CR4","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"A.V. Goldberg","year":"1988","unstructured":"Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum-flow problem. J. ACM\u00a035(4), 921\u2013940 (1988)","journal-title":"J. ACM"},{"issue":"1","key":"24_CR5","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1287\/moor.19.1.24","volume":"19","author":"O. Goldschmidt","year":"1994","unstructured":"Goldschmidt, O., Hochbaum, D.: A polynomial algorithm for the k-cut problem for fixed k. Mathematics of Operations Research\u00a019(1), 24\u201337 (1994): A preliminary version appeared in FOCS 1988","journal-title":"Mathematics of Operations Research"},{"issue":"4","key":"24_CR6","first-page":"551","volume":"9","author":"R.E. Gomory","year":"1961","unstructured":"Gomory, R.E., Hu, T.C.: Multi-terminal network flows. J. SIAM.\u00a09(4), 551\u2013670 (1961)","journal-title":"J. SIAM."},{"issue":"2","key":"24_CR7","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/s00453-001-0070-2","volume":"32","author":"Y. Kamidoi","year":"2002","unstructured":"Kamidoi, Y., Wakabayashi, S., Yoshida, N.: A divide-and-conquer approach to the minimum k-way cut problem. Algorithmica\u00a032(2), 262\u2013276 (2002)","journal-title":"Algorithmica"},{"issue":"5","key":"24_CR8","doi-asserted-by":"publisher","first-page":"1329","DOI":"10.1137\/050631616","volume":"36","author":"Y. Kamidoi","year":"2006","unstructured":"Kamidoi, Y., Yoshida, N., Nagamochi, H.: A deterministic algorithm for finding all minimum k-way cuts. SIAM Journal on Computing\u00a036(5), 1329\u20131341 (2006)","journal-title":"SIAM Journal on Computing"},{"key":"24_CR9","volume-title":"Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization","author":"S. Kapoor","year":"1996","unstructured":"Kapoor, S.: On minimum 3-cuts and approximating k-cuts using cut trees. In: Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization, Springer, London (1996)"},{"issue":"4","key":"24_CR10","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1145\/234533.234534","volume":"43","author":"D.R. Karger","year":"1996","unstructured":"Karger, D.R., Stein, C.: A new approach to the minimum cut problem. Journal of the ACM\u00a043(4), 601\u2013640 (1996): Preliminary portions appeared in SODA 1993 and STOC 1993","journal-title":"Journal of the ACM"},{"key":"24_CR11","unstructured":"Karypis, G., Kumar, V.: hmetis: A hypergraph partitioning package version 1.5, user manual (1998), \n                    \n                      http:\/\/glaros.dtc.umn.edu\/gkhome\/fetch\/sw\/hmetis\/manual.pdf"},{"issue":"3","key":"24_CR12","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1155\/2000\/19436","volume":"11","author":"G. Karypis","year":"2000","unstructured":"Karypis, G., Kumar, V.: Multilevel k-way hypergraph partitioning. VLSI Design\u00a011(3), 285\u2013300 (2000)","journal-title":"VLSI Design"},{"key":"24_CR13","unstructured":"Klimmek, R., Wagner, F.: A simple hypergraph min cut algorithm, Internal Report B 96-02 Bericht FU Berlin Fachbereich Mathematik und Informatik (1995)"},{"issue":"3","key":"24_CR14","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1002\/net.3230030306","volume":"3","author":"E.L. Lawler","year":"1973","unstructured":"Lawler, E.L.: Cutsets and partitions of hypergraphs. Networks\u00a03(3), 275\u2013285 (1973)","journal-title":"Networks"},{"key":"24_CR15","unstructured":"Levine, M.S.: Fast randomized algorithms for computing minimum {3,4,5,6}-way cuts. In: Proceedings of the 11th annual ACM-SIAM symposium on Discrete algorithms (SODA 2000), Philadelphia, PA, USA. Society for Industrial and Applied Mathematics (2000)"},{"issue":"1","key":"24_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0167-9260(00)00008-0","volume":"30","author":"W.-K. Mak","year":"2000","unstructured":"Mak, W.-K., Wong, D.F.: A fast hypergraph min-cut algorithm for circuit partitioning. Integration, the VLSI Journal\u00a030(1), 1\u201311 (2000)","journal-title":"Integration, the VLSI Journal"},{"issue":"1","key":"24_CR17","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1137\/0405004","volume":"5","author":"H. Nagamochi","year":"1992","unstructured":"Nagamochi, H., Ibaraki, T.: Computing edge connectivity in multigraphs and capacitated graphs. SIAM Journal on Discrete Mathematics\u00a05(1), 54\u201366 (1992)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"3","key":"24_CR18","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/PL00011383","volume":"88","author":"H. Nagamochi","year":"2000","unstructured":"Nagamochi, H., Ibaraki, T.: A fast algorithm for computing minimum 3-way and 4-way cuts. Mathematical Programming\u00a088(3), 507\u2013520 (2000)","journal-title":"Mathematical Programming"},{"key":"24_CR19","series-title":"Lecture Notes in Computer Science","volume-title":"Computing and Combinatorics","author":"H. Nagamochi","year":"1999","unstructured":"Nagamochi, H., Katayama, S., Ibaraki, T.: A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs. In: Asano, T., Imai, H., Lee, D.T., Nakano, S.-i., Tokuyama, T. (eds.) COCOON 1999. LNCS, vol.\u00a01627, Springer, Heidelberg (1999)"},{"key":"24_CR20","unstructured":"Preas, B.T., Lorenzetti, M.: Physical Design Automation of VLSI Systems, Benjamin-Cummings, California (1988)"},{"issue":"4","key":"24_CR21","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1145\/263867.263872","volume":"44","author":"M. Stoer","year":"1997","unstructured":"Stoer, M., Wagner, F.: A simple min-cut algorithm. Journal of the ACM\u00a044(4), 585\u2013591 (1997); A preliminary version appeared in ESA 1994","journal-title":"Journal of the ACM"},{"key":"24_CR22","volume-title":"Automata, Languages and Programming. Proc. of the 19th International Colloquium","author":"V.V. Vazirani","year":"1992","unstructured":"Vazirani, V.V., Yannakakis, M.: Suboptimal cuts: Their enumeration, weight and number. In: Kuich, W. (ed.) Automata, Languages and Programming. Proc. of the 19th International Colloquium, Springer, Berlin (1992)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79228-4_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:14:15Z","timestamp":1619507655000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79228-4_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540792277","9783540792284"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79228-4_24","relation":{},"subject":[]}}