{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:40:53Z","timestamp":1725475253623},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540340751"},{"type":"electronic","value":"9783540340768"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11751595_83","type":"book-chapter","created":{"date-parts":[[2006,5,11]],"date-time":"2006-05-11T14:27:59Z","timestamp":1147357679000},"page":"785-792","source":"Crossref","is-referenced-by-count":0,"title":["Two-Server Network Disconnection Problem"],"prefix":"10.1007","author":[{"given":"Byung-Cheon","family":"Choi","sequence":"first","affiliation":[]},{"given":"Sung-Pil","family":"Hong","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"83_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and Approximation","author":"G. Ausiello","year":"1999","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation. Springer, Berlin (1999)"},{"key":"83_CR2","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/S0167-6377(97)00043-6","volume":"21","author":"M. Burlet","year":"1997","unstructured":"Burlet, M., Goldschmidt, O.: A new and improved algorithm for the 3-cut problem. Operations Research Letters\u00a021, 225\u2013227 (1997)","journal-title":"Operations Research Letters"},{"key":"83_CR3","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1145\/276698.276711","volume-title":"Proc. 30th ACM Symposium on Theory of Computing","author":"G. C\u0103linescu","year":"1998","unstructured":"C\u0103linescu, G., Karloff, H., Rabani, Y.: An improved approximation algorithm for muliway cut. In: Proc. 30th ACM Symposium on Theory of Computing, pp. 48\u201352. ACM, New York (1998)"},{"key":"83_CR4","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, 864\u2013894 (1994)","journal-title":"SIAM Journal on Computing"},{"key":"83_CR5","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. W.H. Freeman, New York (1979)"},{"key":"83_CR6","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1137\/S0097539793243016","volume":"25","author":"N. Garg","year":"1996","unstructured":"Garg, N., Vazirani, V.V., Yanakakis, M.: Approximating max-flow min-(multi)cut theorems and their applications. SIAM Journal on Computing\u00a025, 235\u2013251 (1996)","journal-title":"SIAM Journal on Computing"},{"key":"83_CR7","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1287\/moor.19.1.24","volume":"19","author":"O. Goldschmidt","year":"1994","unstructured":"Goldschmidt, O., Hochbaum, D.S.: A polynomial time algorithm for the k-cut problem for k fixed. Mathematics of Operations Research\u00a019, 24\u201337 (1994)","journal-title":"Mathematics of Operations Research"},{"key":"83_CR8","unstructured":"Martel, C., Nuckolls, G., Sniegowski, D.: Computing the disconnectivity of a graph, UC Davis (2001) manuscript"},{"key":"83_CR9","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1137\/S009753979732147X","volume":"31","author":"J. Maor","year":"2001","unstructured":"Maor, J., Zosin, L.: A 2-approximation algorithm for the directed multiway cut problem. SIAM Journal on Computing\u00a031, 477\u2013482 (2001)","journal-title":"SIAM Journal on Computing"},{"key":"83_CR10","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1002\/net.3230050405","volume":"5","author":"J.C. Picard","year":"1974","unstructured":"Picard, J.C., Ratliff, H.D.: Minimum cuts and related problems. Networks\u00a05, 357\u2013370 (1974)","journal-title":"Networks"},{"key":"83_CR11","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1109\/SFCS.1991.185443","volume-title":"Proc. 32nd Annual IEEE Symposium on Foundations of Computer Science","author":"H. Saran","year":"1991","unstructured":"Saran, H., Vazirani, V.V.: Finding k-cuts within twice the optimal. In: Proc. 32nd Annual IEEE Symposium on Foundations of Computer Science, pp. 743\u2013751. IEEE Computer Society, Los Alamitos (1991)"},{"key":"83_CR12","doi-asserted-by":"crossref","unstructured":"Yannakakis, M., Kanellakis, P.C., Cosmadakis, S.C., Papadmitriou, C.H.: Cutting and partitioning a graph after a fixed pattern, in Automata, Language and Programming. Lecture Notes and Computer Science, vol.\u00a0154, pp. 712\u2013722 (1983)","DOI":"10.1007\/BFb0036950"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications - ICCSA 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11751595_83.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,7]],"date-time":"2023-05-07T11:31:28Z","timestamp":1683459088000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11751595_83"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540340751","9783540340768"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11751595_83","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}