{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:04:38Z","timestamp":1725559478725},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540259206"},{"type":"electronic","value":"9783540320784"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11427186_17","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T17:38:24Z","timestamp":1279042704000},"page":"177-188","source":"Crossref","is-referenced-by-count":2,"title":["From Static Code Distribution to More Shrinkage for the Multiterminal Cut"],"prefix":"10.1007","author":[{"given":"Bram","family":"De Wachter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandre","family":"Genon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thierry","family":"Massart","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Massart, T., DeWachter, B., Genon, A.: From static code distribution to more shrinkage for the multiterminal cut. Technical Report 007, U.L.B. (December 2004)","key":"17_CR1","DOI":"10.1007\/11427186_17"},{"issue":"3","key":"17_CR2","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1006\/jcss.1999.1687","volume":"60","author":"G. Calinescu","year":"2000","unstructured":"Calinescu, G., Karloff, H., Rabani, Y.: An improved approximation algorithm for multiway cut. J. Comput. Syst. Sci.\u00a060(3), 564\u2013574 (2000)","journal-title":"J. Comput. Syst. Sci."},{"key":"17_CR3","first-page":"7","volume":"73","author":"S. Chopra","year":"1996","unstructured":"Chopra, S., Owen, J.H.: Extended formulations for the a-cut problem. Math. Program.\u00a073, 7\u201330 (1996)","journal-title":"Math. Program."},{"issue":"1","key":"17_CR4","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.ejor.2003.10.037","volume":"162","author":"M. Costa","year":"2005","unstructured":"Costa, M., Letocart, L., Roupin, F.: Minimal multicut and maximal integer multiflow: a survey. European Journal of Operational Research\u00a0162(1), 55\u201369 (2005)","journal-title":"European Journal of Operational Research"},{"key":"17_CR5","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1090\/dimacs\/005\/07","volume":"5","author":"W.H. Cunningham","year":"1991","unstructured":"Cunningham, W.H.: The optimal multiterminal cut problem. DIMACS series in discrete mathematics and theoretical computer science\u00a05, 105\u2013120 (1991)","journal-title":"DIMACS series in discrete mathematics and theoretical computer science"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","first-page":"29","volume-title":"Integer Programming and Combinatorial Optimization","author":"R. Vohra","year":"1995","unstructured":"Vohra, R., Bertsimas, D., Teo, C.: Nonlinear formulations and improved randomized approximation algorithms for multicut problems. In: Balas, E., Clausen, J. (eds.) IPCO 1995. LNCS, vol.\u00a0920, pp. 29\u201339. Springer, Heidelberg (1995)"},{"issue":"4","key":"17_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 J. Comput.\u00a023(4), 864\u2013894 (1994)","journal-title":"SIAM J. Comput."},{"key":"17_CR8","volume-title":"Flows in Networks","author":"L.R. Ford","year":"1962","unstructured":"Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)"},{"key":"17_CR9","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/3-540-58201-0_92","volume-title":"Proceedings of the 21st International Colloquium on Automata, Languages and Programming","author":"N. Garg","year":"1994","unstructured":"Garg, N., Vazirani, V.V., Yannakakis, M.: Multiway cuts in directed and node weighted graphs. In: Proceedings of the 21st International Colloquium on Automata, Languages and Programming, pp. 487\u2013498. Springer, Heidelberg (1994)"},{"issue":"4","key":"17_CR10","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 (JACM)\u00a035(4), 921\u2013940 (1988)","journal-title":"Journal of the ACM (JACM)"},{"issue":"4","key":"17_CR11","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/544397.544408","volume":"28","author":"K. Hogstedt","year":"2001","unstructured":"Hogstedt, K., Kimelman, D.: Graph cutting algorithms for distributed applications partitioning. SIGMETRICS Performance Evaluation Review\u00a028(4), 27\u201329 (2001)","journal-title":"SIGMETRICS Performance Evaluation Review"},{"issue":"2","key":"17_CR12","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1023\/A:1009799631608","volume":"1","author":"L. Hollermann","year":"1997","unstructured":"Hollermann, L., Hsu, T.s., Lopez, D.R., Vertanen, K.: Scheduling problems in a practical allocation model. J. Comb. Optim.\u00a01(2), 129\u2013149 (1997)","journal-title":"J. Comb. Optim."},{"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: STOC 1999: Proceedings of the thirty-first annual ACM symposium on Theory of computing, pp. 668\u2013678 (1999)","key":"17_CR13","DOI":"10.1145\/301250.301430"},{"issue":"2","key":"17_CR14","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1137\/S009753979732147X","volume":"31","author":"J. Naor","year":"2001","unstructured":"Naor, J., Zosin, L.: A 2-approximation algorithm for the directed multiway cut problem. SIAM J. Comput.\u00a031(2), 477\u2013482 (2001)","journal-title":"SIAM J. Comput."},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1002\/net.3230210106","volume":"21","author":"M.R. Rao","year":"1991","unstructured":"Rao, M.R., Chopra, S.: On the multiway cut polyhedron. Networks\u00a021, 51\u201389 (1991)","journal-title":"Networks"},{"issue":"12","key":"17_CR16","doi-asserted-by":"publisher","first-page":"1339","DOI":"10.1109\/12.895858","volume":"49","author":"T.s. Hsu","year":"2000","unstructured":"Hsu, T.s., Lee, J.C., Lopez, D.R., Royce, W.A.: Task allocation on a network of processors. IEEE Trans. Computers\u00a049(12), 1339\u20131353 (2000)","journal-title":"IEEE Trans. Computers"},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-540-27860-3_14","volume-title":"Principles of Distributed Systems","author":"B. Wachter De","year":"2004","unstructured":"De Wachter, B., Massart, T., Meuter, C.: dsl: An environment with automatic code distribution for industrial control systems. In: Papatriantafilou, M., Hunel, P. (eds.) OPODIS 2003. LNCS, vol.\u00a03144, pp. 132\u2013145. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Experimental and Efficient Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11427186_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T21:28:03Z","timestamp":1559251683000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11427186_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540259206","9783540320784"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11427186_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}