{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:31:26Z","timestamp":1725798686791},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662444641"},{"type":"electronic","value":"9783662444658"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44465-8_9","type":"book-chapter","created":{"date-parts":[[2014,8,12]],"date-time":"2014-08-12T10:33:02Z","timestamp":1407839582000},"page":"94-105","source":"Crossref","is-referenced-by-count":0,"title":["Minimum Planar Multi-sink Cuts with Connectivity Priors"],"prefix":"10.1007","author":[{"given":"Ivona","family":"Bez\u00e1kov\u00e1","sequence":"first","affiliation":[]},{"given":"Zachary","family":"Langley","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Bateni, M., Hajiaghayi, M., Klein, P.N., Mathieu, C.: A polynomial-time approximation scheme for planar multiway cut. In: Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). pp. 639\u2013655 (2012)","DOI":"10.1137\/1.9781611973099.54"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-642-32241-9_5","volume-title":"Computing and Combinatorics","author":"I. Bez\u00e1kov\u00e1","year":"2012","unstructured":"Bez\u00e1kov\u00e1, I., Langley, Z.: Contiguous minimum single-source-multi-sink cuts in weighted planar graphs. In: Gudmundsson, J., Mestre, J., Viglas, T. (eds.) COCOON 2012. LNCS, vol.\u00a07434, pp. 49\u201360. Springer, Heidelberg (2012)"},{"issue":"1","key":"9_CR3","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/BF01840379","volume":"5","author":"D. Bienstock","year":"1990","unstructured":"Bienstock, D., Monma, C.L.: On the complexity of embedding planar graphs to minimize certain distance measures. Algorithmica\u00a05(1), 93\u2013109 (1990)","journal-title":"Algorithmica"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Borradaile, G., Klein, P.N.: An O(nlogn) algorithm for maximum st-flow in a directed planar graph. J. ACM 56(2) (2009)","DOI":"10.1145\/1502793.1502798"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Borradaile, G., Klein, P.N., Mozes, S., Nussbaum, Y., Wulff-Nilsen, C.: Multiple-source multiple-sink maximum flow in directed planar graphs in near-linear time. In: Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS), pp. 170\u2013179 (2011)","DOI":"10.1109\/FOCS.2011.73"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Boykov, Y., Veksler, O.: Graph cuts in vision and graphics: Theories and applications. In: Handbook of Mathematical Models in Computer Vision. Springer (2006)","DOI":"10.1007\/0-387-28831-7_5"},{"issue":"11","key":"9_CR7","doi-asserted-by":"publisher","first-page":"1222","DOI":"10.1109\/34.969114","volume":"23","author":"Y. Boykov","year":"2001","unstructured":"Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE Trans. Pattern Anal. Mach. Intell.\u00a023(11), 1222\u20131239 (2001)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"#cr-split#-9_CR8.1","doi-asserted-by":"crossref","unstructured":"Cabello, S.: Finding shortest contractible and shortest separating cycles in embedded graphs. ACM Trans. on Algorithms 6(2) (2010);","DOI":"10.1145\/1721837.1721840"},{"key":"#cr-split#-9_CR8.2","unstructured":"Ext. abstr. in SODA 2009"},{"key":"9_CR9","unstructured":"Chalermsook, P., Fakcharoenphol, J., Nanongkai, D.: A deterministic near-linear time algorithm for finding minimum cuts in planar graphs. In: Proceedings of the 15th Annual ACM-SIAM Symp. on Discr. Algorithms (SODA), pp. 828\u2013829 (2004)"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Chambers, E.W., Erickson, J., Nayyeri, A.: Minimum cuts and shortest homologous cycles. In: Proceedings of the 25th Annual ACM Symposium on Computational Geometry (SCG), pp. 377\u2013385 (2009)","DOI":"10.1145\/1542362.1542426"},{"issue":"1-2","key":"9_CR11","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.comgeo.2007.10.010","volume":"41","author":"E.W. Chambers","year":"2008","unstructured":"Chambers, E.W., de Verdi\u00e8re, \u00c9.C., Erickson, J., Lazarus, F., Whittlesey, K.: Splitting (complicated) surfaces is hard. Comput. Geom.\u00a041(1-2), 94\u2013110 (2008)","journal-title":"Comput. Geom."},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-642-23719-5_14","volume-title":"Algorithms \u2013 ESA 2011","author":"J. \u0141\u0105cki","year":"2011","unstructured":"\u0141\u0105cki, J., Sankowski, P.: Min-cuts and shortest cycles in planar graphs in O(n loglogn) time. In: Demetrescu, C., Halld\u00f3rsson, M.M. (eds.) ESA 2011. LNCS, vol.\u00a06942, pp. 155\u2013166. Springer, Heidelberg (2011)"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Vicente, S., Kolmogorov, V., Rother, C.: Graph cut based image segmentation with connectivity priors. In: IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR (2008)","DOI":"10.1109\/CVPR.2008.4587440"},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.cviu.2008.07.008","volume":"112","author":"Y. Zeng","year":"2008","unstructured":"Zeng, Y., Samaras, D., Chen, W., Peng, Q.: Topology cuts: A novel min-cut\/max-flow algorithm for topology preserving segmentation in N-D images. Computer Vision Image Understanding\u00a0112, 81\u201390 (2008)","journal-title":"Computer Vision Image Understanding"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44465-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T04:40:38Z","timestamp":1548909638000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44465-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662444641","9783662444658"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44465-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}