{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:45:48Z","timestamp":1770993948057,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642387555","type":"print"},{"value":"9783642387562","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38756-2_32","type":"book-chapter","created":{"date-parts":[[2013,5,21]],"date-time":"2013-05-21T00:43:48Z","timestamp":1369097028000},"page":"315-324","source":"Crossref","is-referenced-by-count":4,"title":["Multi-Multiway Cut Problem on Graphs of Bounded Branch Width"],"prefix":"10.1007","author":[{"given":"Xiaojie","family":"Deng","sequence":"first","affiliation":[]},{"given":"Bingkai","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Chihao","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"32_CR1","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S. Arnborg","year":"1991","unstructured":"Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. Journal of Algorithms\u00a012(2), 308\u2013340 (1991)","journal-title":"Journal of Algorithms"},{"issue":"1-3","key":"32_CR2","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.tcs.2007.02.026","volume":"377","author":"A. Avidor","year":"2007","unstructured":"Avidor, A., Langberg, M.: The multi-multiway cut problem. Theoretical Computer Science\u00a0377(1-3), 35\u201342 (2007)","journal-title":"Theoretical Computer Science"},{"key":"32_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1007\/3-540-63165-8_217","volume-title":"Automata, Languages and Programming","author":"H.L. Bodlaender","year":"1997","unstructured":"Bodlaender, H.L., Thilikos, D.M.: Constructive linear time algorithms for branchwidth. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol.\u00a01256, pp. 627\u2013637. Springer, Heidelberg (1997)"},{"key":"32_CR4","unstructured":"Bousquet, N., Daligault, J., Thomass\u00e9, S., Yeo, A., et al: A polynomial kernel for multicut in trees. In: 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, pp. 183\u2013194 (2009)"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"C\u0103linescu, G., Karloff, H., Rabani, Y.: An improved approximation algorithm for multiway cut. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, pp. 48\u201352. ACM (1998)","DOI":"10.1145\/276698.276711"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Courcelle, B.: Graph rewriting: An algebraic and logic approach. In: Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B), pp. 193\u2013242. Elsevier and MIT Press (1990)","DOI":"10.1016\/B978-0-444-88074-1.50010-X"},{"issue":"4","key":"32_CR7","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1137\/S0097539792225297","volume":"23","author":"E. Dahlhaus","year":"1994","unstructured":"Dahlhaus, E., Johnson, D.S., Papadimitriou, C.H., Seymour, P.D., Yannakakis, M.: The complexity of multiterminal cuts. SIAM Journal on Computing\u00a023(4), 864\u2013894 (1994)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"32_CR8","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1137\/S0097539793243016","volume":"25","author":"N. Garg","year":"1996","unstructured":"Garg, N., Vazirani, V.V., Yannakakis, M.: Approximate max-flow min-(multi) cut theorems and their applications. SIAM Journal on Computing\u00a025(2), 235\u2013251 (1996)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"32_CR9","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/j.ipl.2007.03.005","volume":"103","author":"G. Gottlob","year":"2007","unstructured":"Gottlob, G., Lee, S.T.: A logical approach to multicut problems. Information Processing Letters\u00a0103(4), 136\u2013141 (2007)","journal-title":"Information Processing Letters"},{"key":"32_CR10","unstructured":"Grohe, M.: Logic, graphs, and algorithms. Logic and Automata\u2013History and Perspectives, 357\u2013422 (2007)"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"Kanj, I., Lin, G., Liu, T., Tong, W., Xia, G., Xu, J., Yang, B., Zhang, F., Zhang, P., Zhu, B.: Algorithms for cut problems on trees. arXiv:1304.3635 (2013)","DOI":"10.1007\/978-3-319-12691-3_22"},{"issue":"3","key":"32_CR12","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1287\/moor.1030.0086","volume":"29","author":"D.R. Karger","year":"2004","unstructured":"Karger, D.R., Klein, P., Stein, C., Thorup, M., Young, N.E.: Rounding algorithms for a geometric embedding of minimum multiway cut. Mathematics of Operations Research\u00a029(3), 436\u2013461 (2004)","journal-title":"Mathematics of Operations Research"},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"Liu, H., Zhang, P.: On the generalized multiway cut in trees problem. Journal of Combinatorial Optimization, 1\u201313 (2012)","DOI":"10.1007\/s10878-012-9565-9"},{"issue":"3","key":"32_CR14","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1016\/j.tcs.2005.10.007","volume":"351","author":"D. Marx","year":"2006","unstructured":"Marx, D.: Parameterized graph separation problems. Theoretical Computer Science\u00a0351(3), 394\u2013406 (2006)","journal-title":"Theoretical Computer Science"},{"key":"32_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-642-13073-1_16","volume-title":"Algorithms and Complexity","author":"R. Pichler","year":"2010","unstructured":"Pichler, R., R\u00fcmmele, S., Woltran, S.: Multicut algorithms via tree decompositions. In: Calamoneri, T., Diaz, J. (eds.) CIAC 2010. LNCS, vol.\u00a06078, pp. 167\u2013179. Springer, Heidelberg (2010)"},{"issue":"2","key":"32_CR16","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0095-8956(91)90061-N","volume":"52","author":"N. Robertson","year":"1991","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. x. obstructions to tree-decomposition. Journal of Combinatorial Theory, Series B\u00a052(2), 153\u2013190 (1991)","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"4","key":"32_CR17","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1007\/s00224-009-9215-5","volume":"46","author":"M. Xiao","year":"2010","unstructured":"Xiao, M.: Simple and improved parameterized algorithms for multiterminal cuts. Theory of Computing Systems\u00a046(4), 723\u2013736 (2010)","journal-title":"Theory of Computing Systems"},{"key":"32_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1007\/978-3-540-73001-9_85","volume-title":"Computation and Logic in the Real World","author":"P. Zhang","year":"2007","unstructured":"Zhang, P.: Approximating generalized multicut on trees. In: Cooper, S.B., L\u00f6we, B., Sorbi, A. (eds.) CiE 2007. LNCS, vol.\u00a04497, pp. 799\u2013808. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38756-2_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T03:27:18Z","timestamp":1557718038000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38756-2_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387555","9783642387562"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38756-2_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}