{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:55:18Z","timestamp":1725558918157},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540245742"},{"type":"electronic","value":"9783540318330"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31833-0_7","type":"book-chapter","created":{"date-parts":[[2010,7,2]],"date-time":"2010-07-02T18:11:05Z","timestamp":1278094265000},"page":"61-67","source":"Crossref","is-referenced-by-count":0,"title":["Approximation Algorithm for Directed Multicuts"],"prefix":"10.1007","author":[{"given":"Yana","family":"Kortsarts","sequence":"first","affiliation":[]},{"given":"Guy","family":"Kortsarz","sequence":"additional","affiliation":[]},{"given":"Zeev","family":"Nutov","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","unstructured":"Cheriyan, J., Karloff, H., Rabani, Y.: Approximating directed multicuts. Combinatorica (to appear)"},{"key":"7_CR2","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1998","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT press, Cambridge (1998)","edition":"2"},{"issue":"4","key":"7_CR3","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1145\/347476.347478","volume":"47","author":"G. Even","year":"2000","unstructured":"Even, G., Naor, S., Schieber, B., Rao, S.: Divide-and-Conquer Approximation Algorithms Via Spreading Metrics. Journal of the ACM\u00a047(4), 585\u2013616 (2000)","journal-title":"Journal of the ACM"},{"issue":"4","key":"7_CR4","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1137\/S0895480199355754","volume":"13","author":"L. Fleisher","year":"2000","unstructured":"Fleisher, L.: Approximating Fractional Multicommodity Flows Independent of the Number of Commodities. SIAM J. Discrete Math.\u00a013(4), 505\u2013520 (2000)","journal-title":"SIAM J. Discrete Math."},{"key":"7_CR5","unstructured":"Gupta, A.: Improved approximation algorithm for directed multicut. In: SODA 2003, pp. 454\u2013455 (2003)"},{"issue":"1","key":"7_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF02523685","volume":"18","author":"N. Garg","year":"1997","unstructured":"Garg, N., Vazirani, V., Yannakakis, M.: Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees. Algorithmica\u00a018(1), 3\u201320 (1997)","journal-title":"Algorithmica"},{"issue":"2","key":"7_CR7","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"},{"issue":"2","key":"7_CR8","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1006\/jagm.1996.0833","volume":"22","author":"P.N.. Klein","year":"1997","unstructured":"Klein, P.N., Plotkin, S.A., Rao, S., Tardos, E.: Approximation Algorithms for Steiner and Directed Multicuts. J. Algorithms\u00a022(2), 241\u2013269 (1997)","journal-title":"J. Algorithms"},{"issue":"2","key":"7_CR9","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":"7_CR10","unstructured":"Varadarajan, K., Venkataraman, G.: Graph Decomposition and a Greedy Algorithm for Edge-disjoint Paths. In: Symposium on Discrete Algorithms (SODA 2004), pp. 379\u2013380 (2004)"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31833-0_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:41:26Z","timestamp":1620013286000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31833-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540245742","9783540318330"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31833-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}