{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:51:40Z","timestamp":1725486700350},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540679967"},{"type":"electronic","value":"9783540444367"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44436-x_5","type":"book-chapter","created":{"date-parts":[[2007,6,18]],"date-time":"2007-06-18T09:33:14Z","timestamp":1182159194000},"page":"34-41","source":"Crossref","is-referenced-by-count":2,"title":["An Approximation Algorithm for MAX DICUT with Given Sizes of Parts"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Ageev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Refael","family":"Hassin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maxim","family":"Sviridenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,3]]},"reference":[{"key":"5_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/3-540-48777-8_2","volume-title":"Proceedings of IPCO\u201999","author":"A.A. Ageev","year":"1999","unstructured":"A.A. Ageev and M.I. Sviridenko, Approximation algorithms for Maximum Coverage and Max Cut with given sizes of parts, Lecture Notes in Computer Science (Proceedings of IPCO\u201999) 1610 (1999), 17\u201330."},{"key":"5_CR2","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of ESA\u20192000","author":"A.A. Ageev","year":"2000","unstructured":"A.A. Ageev and M.I. Sviridenko, An approximation algorithm for Hypergraph Max k-Cut with given sizes of parts, Lecture Notes in Computer Science (Proceedings of ESA\u20192000), to appear."},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"U. Feige and M.X. Goemans, Approximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT, Proceedings of the Third Israel Symposium on Theory of Computing and Systems (1995), 182\u2013189.","DOI":"10.1109\/ISTCS.1995.377033"},{"key":"5_CR4","unstructured":"U. Feige and M. Langberg, Approximation algorithms for maximization problems arising in graph partitioning, manuscript, 1999."},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M. X. Goemans","year":"1995","unstructured":"M. X. Goemans and D. P. Williamson, Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming, J. ACM\n                           42 (1995), 1115\u20131145.","journal-title":"J. ACM"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"K. Jain, A factor 2 approximation algorithm for the generalized Steiner network problem, Proceedings of FOCS\u201998 (1998), 448\u2013457.","DOI":"10.1109\/SFCS.1998.743495"},{"key":"5_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/3-540-48777-8_26","volume-title":"Proceedings of IPCO\u201999","author":"V. Melkonian","year":"1999","unstructured":"V. Melkonian and \u00c9. Tardos, Approximation algorithms for a directed network design problem, Lecture Notes in Computer Science (Proceedings of IPCO\u201999) 1610 (1999), 345\u2013360."}],"container-title":["Lecture Notes in Computer Science","Approximation Algorithms for Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44436-X_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T10:09:56Z","timestamp":1550398196000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44436-X_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679967","9783540444367"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-44436-x_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}