{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:48Z","timestamp":1725559008571},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540223399"},{"type":"electronic","value":"9783540278108"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27810-8_24","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T17:27:29Z","timestamp":1279042049000},"page":"273-284","source":"Crossref","is-referenced-by-count":8,"title":["The Multi-multiway Cut Problem"],"prefix":"10.1007","author":[{"given":"Adi","family":"Avidor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Langberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","unstructured":"Chrikar, M., Guruswami, V., Wirth, A.: Clustering with qualitative information. In: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (2003)"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Calinescu, G., Karloff, H., Rabani, Y.: An improved approximation algorithm for multiway cut. In: Proceedings of the 30th Ann. ACM Symp. on Theory of Comp., ACM-SIAM (1998)","DOI":"10.1145\/276698.276711"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Cheriyan, J., Karloff, H.J., Rabani, Y.: Approximating directed multicuts. In: Proceedings of IEEE Symposium on Foundations of Computer Science (2001)","DOI":"10.1109\/SFCS.2001.959906"},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/3-540-48777-8_9","volume-title":"Integer Programming and Combinatorial Optimization","author":"W.H. Cunningham","year":"1999","unstructured":"Cunningham, W.H., Tang, L.: Optimal 3-terminal cuts and linear programming. In: Cornu\u00e9jols, G., Burkard, R.E., Woeginger, G.J. (eds.) IPCO 1999. LNCS, vol.\u00a01610, pp. 114\u2013125. Springer, Heidelberg (1999)"},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"E.D. Demaine","year":"2003","unstructured":"Demaine, E.D., Immorlica, N.: Correlation clustering with partial information. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds.) RANDOM 2003 and APPROX 2003. LNCS, vol.\u00a02764, pp. 1\u201313. Springer, Heidelberg (2003)"},{"key":"24_CR6","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1137\/S0097539792225297","volume":"23","author":"R. Dahlhaus","year":"1994","unstructured":"Dahlhaus, R., Johnson, D.S., Papadimitriou, C.H., Seymour, P.D., Yannakakis, M.: The complexity of multiterminal cuts. SIAM Journal on Computing\u00a023, 864\u2013894 (1994)","journal-title":"SIAM Journal on Computing"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Downey, R.: Parameterized complexity for the skeptic. In: Proceedings of 18th IEEE Conference on Computational Complexity (2003)","DOI":"10.1109\/CCC.2003.1214417"},{"issue":"2","key":"24_CR8","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/PL00009191","volume":"20","author":"G. Even","year":"1998","unstructured":"Even, G., Naor, J., Schieber, B., Sudan, M.: Approximating minimum feedback sets and multicuts in directed graphs. Algorithmica\u00a020(2), 151\u2013174 (1998)","journal-title":"Algorithmica"},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"L.R. Ford","year":"1956","unstructured":"Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. Canadian Journal of Mathematics\u00a08, 399\u2013404 (1956)","journal-title":"Canadian Journal of Mathematics"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Feige, U., Goemans, M.X.: Approximating the value of two prover proof systems with applications to Max-2-Sat and Max-Dicut. In: Proceedings of the 3rd Israel Symposium on Theory of Computing and Systems, pp. 182\u2013189 (1995)","DOI":"10.1109\/ISTCS.1995.377033"},{"key":"24_CR11","unstructured":"Gupta, A.: Improved results for directed multicut. In: Proceedings 14th Ann. ACM-SIAM Symp. on Discrete Algorithms, pp. 454\u2013455. ACM-SIAM (2003)"},{"issue":"2","key":"24_CR12","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1137\/S0097539793243016","volume":"25","author":"N. Garg","year":"1996","unstructured":"Garg, N., Vazirani, 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"},{"key":"24_CR13","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M.X. Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of ACM\u00a042, 1115\u20131145 (1995)","journal-title":"Journal of ACM"},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"Karger, D.R., Klein, P., Stein, C., Thorup, M., Young, N.E.: Rounding algorithms for a geometric embedding of minimum multiway cut. In: Proceedings of ACM Symposium on the Theory of Computing, pp. 668\u2013678 (1999)","DOI":"10.1145\/301250.301430"},{"key":"24_CR15","unstructured":"Klein, P.N., Plotkin, S.A., Rao, S., Tardos, S.E.: New network decompositions theorems with applications. Brown University Technical Report CS-93-30 (1993)"},{"key":"24_CR16","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/BF01200755","volume":"15","author":"P. Klein","year":"1995","unstructured":"Klein, P., Rao, S., Agrawal, A., Ravi, R.: An approximate max-flow min-cut relation for undirected multicommodity flow, with applications. Combinatorica\u00a015, 187\u2013202 (1995)","journal-title":"Combinatorica"},{"key":"24_CR17","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF02126799","volume":"8","author":"A. Lubotzky","year":"1988","unstructured":"Lubotzky, A., Phillips, R., Sarnak, P.: Ramanujan graphs. Combinatorica\u00a08, 261\u2013277 (1988)","journal-title":"Combinatorica"},{"issue":"6","key":"24_CR18","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1145\/331524.331526","volume":"46","author":"F.T. Leighton","year":"1999","unstructured":"Leighton, F.T., Rao, S.: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. Journal of the ACM\u00a046(6), 787\u2013832 (1999)","journal-title":"Journal of the ACM"},{"key":"24_CR19","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1006\/jagm.1998.0996","volume":"31","author":"M. Mahajan","year":"1999","unstructured":"Mahajan, M., Raman, V.: Parameterizing above guaranteed values: MaxSat and MaxCut. Journal of Algorithms\u00a031, 355\u2013354 (1999)","journal-title":"Journal of Algorithms"},{"key":"24_CR20","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"C.H. Papadimitriou","year":"1991","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. Journal of Computer and System Sciences\u00a043, 425\u2013440 (1991)","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"24_CR21","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BF01200760","volume":"15","author":"P.D. Seymour","year":"1995","unstructured":"Seymour, P.D.: Packing directed circuits fractionally. Combinatorica\u00a015(2), 281\u2013288 (1995)","journal-title":"Combinatorica"},{"key":"24_CR22","unstructured":"Shmoys, D.: Cut problems and their applications to divide-and-conquer. In: Hochbaum, D. (ed.) Approximation Algorithms for NP-Hard Problems, pp. 192\u2013235. PWS Publishing (1996)"},{"key":"24_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1007\/BFb0036950","volume-title":"Automata, Languages and Programming","author":"M. Yannakakis","year":"1983","unstructured":"Yannakakis, M., Kanellakis, P.C., Cosmadakis, S.C., Papadimitriou, C.H.: Cutting and partitioning a graph after a fixed pattern. In: D\u00edaz, J. (ed.) ICALP 1983. LNCS, vol.\u00a0154, pp. 712\u2013722. Springer, Heidelberg (1983)"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory - SWAT 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27810-8_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:27:08Z","timestamp":1620012428000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27810-8_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223399","9783540278108"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27810-8_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}