{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:56:53Z","timestamp":1725796613644},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319087825"},{"type":"electronic","value":"9783319087832"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08783-2_30","type":"book-chapter","created":{"date-parts":[[2014,7,5]],"date-time":"2014-07-05T14:04:30Z","timestamp":1404569070000},"page":"346-356","source":"Crossref","is-referenced-by-count":1,"title":["A New Approximation Algorithm for the Unbalanced Min s-t Cut Problem"],"prefix":"10.1007","author":[{"given":"Peng","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Lang, K., Dasgupta, A., Mahoney, M.: Statistical properties of community structure in large social and information networks. In: Proceedings of the 17th International World Wide Web Conference (WWW), pp. 695\u2013704 (2008)","DOI":"10.1145\/1367497.1367591"},{"key":"30_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-642-17517-6_21","volume-title":"Algorithms and Computation","author":"A. Li","year":"2010","unstructured":"Li, A., Zhang, P.: Unbalanced graph partitioning. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010, Part I. LNCS, vol.\u00a06506, pp. 218\u2013229. Springer, Heidelberg (2010)"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"R\u00e4cke, H.: Optimal hierarchical decompositions for congestion minimization in networks. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC), pp. 255\u2013264 (2008)","DOI":"10.1145\/1374376.1374415"},{"key":"30_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/11561071_19","volume-title":"Algorithms \u2013 ESA 2005","author":"A. Hayrapetyan","year":"2005","unstructured":"Hayrapetyan, A., Kempe, D., P\u00e1l, M., Svitkina, Z.: Unbalanced graph cuts. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 191\u2013202. Springer, Heidelberg (2005)"},{"issue":"1","key":"30_CR5","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1137\/0218003","volume":"18","author":"G. Gallo","year":"1989","unstructured":"Gallo, G., Grigoriadis, M.D., Tarjan, R.E.: A fast parametric maximum flow algorithm and applications. SIAM Journal on Computing\u00a018(1), 30\u201355 (1989)","journal-title":"SIAM Journal on Computing"},{"key":"30_CR6","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1016\/S0166-218X(02)00394-3","volume":"127","author":"U. Feige","year":"2003","unstructured":"Feige, U., Krauthgamer, R., Nissim, K.: On cutting a few vertices from a graph. Discrete Applied Mathematics\u00a0127, 643\u2013649 (2003)","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"30_CR7","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1145\/234533.234534","volume":"43","author":"D. Karger","year":"1996","unstructured":"Karger, D., Stein, C.: A new approach to the minimum cut problem. Journal of the ACM\u00a043(4), 601\u2013640 (1996)","journal-title":"Journal of the ACM"},{"issue":"1","key":"30_CR8","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s00453-006-0068-x","volume":"46","author":"A. Armon","year":"2006","unstructured":"Armon, A., Zwick, U.: Multicriteria global minimum cuts. Algorithmica\u00a046(1), 15\u201326 (2006)","journal-title":"Algorithmica"},{"issue":"3","key":"30_CR9","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1137\/S0895480194271323","volume":"10","author":"H. Nagamochi","year":"1997","unstructured":"Nagamochi, H., Nishimura, K., Ibaraki, T.: Computing all small cuts in an undirected network. SIAM Journal on Discrete Mathematics\u00a010(3), 469\u2013481 (1997)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Fomin, F., Golovach, P., Korhonen, J.: On the parameterized complexity of cutting a few vertices from a graph. CoRR abs\/1304.6189 (2013)","DOI":"10.1007\/978-3-642-40313-2_38"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Chuzhoy, J., Makarychev, Y., Vijayaraghavan, A., Zhou, Y.: Approximation algorithms and hardness of the k-route cut problem. In: Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 780\u2013799 (2012)","DOI":"10.1137\/1.9781611973099.63"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"Svitkina, Z., Tardos, \u00c9.: Min-max multiway cut. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) APPROX and RANDOM 2004. LNCS, vol.\u00a03122, pp. 207\u2013218. Springer, Heidelberg (2004)","DOI":"10.1007\/978-3-540-27821-4_19"},{"key":"30_CR13","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1145\/321978.321982","volume":"23","author":"M.J. Eisner","year":"1976","unstructured":"Eisner, M.J., Severance, D.G.: Mathematical techniques for efficient record segmentation in large shared databases. Journal of the ACM\u00a023, 619\u2013635 (1976)","journal-title":"Journal of the ACM"},{"key":"30_CR14","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1109\/TSE.1978.231502","volume":"4","author":"H.S. Stone","year":"1978","unstructured":"Stone, H.S.: Critical load factors in two-processor distributed systems. IEEE Transactions on Software Engineering\u00a04, 254\u2013258 (1978)","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"4","key":"30_CR15","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. Journal of the ACM\u00a035(4), 921\u2013940 (1988)","journal-title":"Journal of the ACM"},{"key":"30_CR16","volume-title":"Combinatorial Optimizatoin: Algorithms and Complexity","author":"C.H. Papadimitriou","year":"1998","unstructured":"Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimizatoin: Algorithms and Complexity. Dover Publications, Inc., Mineola (1998)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08783-2_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T06:31:02Z","timestamp":1558938662000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08783-2_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319087825","9783319087832"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08783-2_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}