{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:42:54Z","timestamp":1725892974377},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540660194"},{"type":"electronic","value":"9783540487777"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48777-8_9","type":"book-chapter","created":{"date-parts":[[2007,3,2]],"date-time":"2007-03-02T13:43:11Z","timestamp":1172842991000},"page":"114-125","source":"Crossref","is-referenced-by-count":14,"title":["Optimal 3-Terminal Cuts and Linear Programming"],"prefix":"10.1007","author":[{"given":"William H.","family":"Cunningham","sequence":"first","affiliation":[]},{"given":"Lawrence","family":"Tang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1999,4,30]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"G. C\u0103linescu, H. Karloff, and Y. Rabani: An improved approximation algorithm for MULTIWAY CUT Proceedings of Symposium on Theory of Computing, ACM, 1998.","DOI":"10.1145\/276698.276711"},{"key":"9_CR2","unstructured":"Kevin Cheung, private communication, 1999."},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1002\/net.3230210106","volume":"21","author":"S. Chopra","year":"1991","unstructured":"S. Chopra and M.R. Rao, \u201cOn the multiway cut polyhedron\u201d, Networks 21(1991), 51\u201389.","journal-title":"Networks"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"W.H. Cunningham, \u201cThe optimal multiterminal cut problem\u201d, in: C. Monma and F. Hwang (eds.), Reliability of Computer and Communications Networks, American Math. Soc., 1991, pp. 105\u2013120.","DOI":"10.1090\/dimacs\/005\/07"},{"key":"9_CR5","unstructured":"E. Dahlhaus, D. Johnson, C. Papadimitriou, P. Seymour, and M. Yannakakis, \u201cThe Complexity of multiway cuts\u201d, extended abstract, 1983."},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1137\/S0097539792225297","volume":"23","author":"E. Dahlhaus","year":"1994","unstructured":"E. Dahlhaus, D. Johnson, C. Papadimitriou, P. Seymour, and M. Yannakakis, \u201cThe Complexity of multiterminal cuts\u201d, SIAM J. Computing, 23(1994), 864\u2013894.","journal-title":"SIAM J. Computing"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"D. Karger, P. Klein, C. Stein, M. Thorrup, and N. Young, \u201cRounding algorithms for a geometric embedding of minimum multiway cut,\u201d Proceedings of Symposium on Theory of Computing, ACM, 1999, to appear.","DOI":"10.1145\/301250.301430"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48777-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T02:18:40Z","timestamp":1556158720000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48777-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540660194","9783540487777"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-48777-8_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}