{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:01:33Z","timestamp":1725487293141},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540404934"},{"type":"electronic","value":"9783540450610"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45061-0_17","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T15:54:04Z","timestamp":1184601244000},"page":"189-199","source":"Crossref","is-referenced-by-count":1,"title":["Approximating Steiner k-Cuts"],"prefix":"10.1007","author":[{"given":"Chandra","family":"Chekuri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sudipto","family":"Guha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph Seffi","family":"Naor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1006\/jcss.1999.1687","volume":"60","author":"G. C\u0103linescu","year":"2000","unstructured":"G. C\u0103linescu, H. Karloff, and Y. Rabani. An improved approximation algorithm for multiway cut. Journal of Computer and System Sciences, 60:564\u2013574, 2000.","journal-title":"Journal of Computer and System Sciences"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1137\/S0097539792225297","volume":"23","author":"E. Dahlhaus","year":"1994","unstructured":"E. Dahlhaus, D. S. Johnson, C. H. Papadimitriou, P. D. Seymour, and M. Yannakakis. The complexity of multiterminal cuts. SIAM J. on Computing, 23:864\u2013894, 1994.","journal-title":"SIAM J. on Computing"},{"key":"17_CR3","doi-asserted-by":"crossref","first-page":"233","DOI":"10.6028\/jres.071B.032","volume":"B71","author":"J. Edmonds","year":"1967","unstructured":"J. Edmonds. Optimum branchings. J. Res. Nat. Bur. Standards, B71:233\u2013240, 1967.","journal-title":"J. Res. Nat. Bur. Standards"},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1137\/S0097539793242618","volume":"24","author":"M. Goemans","year":"1995","unstructured":"M. Goemans and D. Williamson. A general approximation technique for constrained forest problems. SIAM J. on Computing, 24:296\u2013317, 1995.","journal-title":"SIAM J. on Computing"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1287\/moor.19.1.24","volume":"19","author":"O. Goldschmidt","year":"1994","unstructured":"O. Goldschmidt and D. Hochbaum. Polynomial algorithm for the k-cut problem. Mathematics of Operations Research, 19:24\u201337, 1994.","journal-title":"Mathematics of Operations Research"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1145\/234533.234534","volume":"43","author":"D. Karger","year":"1996","unstructured":"D. Karger and C. Stein. A new approach to the minimum cut problem. Journal of the ACM, 43:601\u2013640, 1996.","journal-title":"Journal of the ACM"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"D. Karger, P. Klein, C. Stein, M. Thorup, and N. Young. Rounding algorithms for a geometric embedding of minimum multiway cut. In Proceedings of the 29th ACN Symposium on Theory of Computing, pp. 668\u2013678, 1999.","DOI":"10.1145\/301250.301430"},{"key":"17_CR8","unstructured":"J. Naor and Y. Rabani. Approximating k-cuts. In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 26\u201327, 2001."},{"key":"17_CR9","unstructured":"R. Ravi and A. Sinha. Approximating k-cuts via Network Strength. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 621\u2013622, 2002."},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1137\/S0097539792251730","volume":"24","author":"H. Saran","year":"1995","unstructured":"H. Saran and V.V. Vazirani. Finding k-cuts within twice the optimal. SIAM J. on Computing, 24:101\u2013108, 1995.","journal-title":"SIAM J. on Computing"},{"key":"17_CR11","unstructured":"V. Vazirani. Approximation Algorithms. Springer, 2001."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45061-0_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T23:19:41Z","timestamp":1550445581000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45061-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540404934","9783540450610"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-45061-0_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}