{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:59:15Z","timestamp":1725483555408},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424703"},{"type":"electronic","value":"9783540446668"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44666-4_17","type":"book-chapter","created":{"date-parts":[[2007,5,3]],"date-time":"2007-05-03T12:58:07Z","timestamp":1178197087000},"page":"138-146","source":"Crossref","is-referenced-by-count":12,"title":["0.863-Approximation Algorithm for MAX DICUT"],"prefix":"10.1007","author":[{"given":"Shiro","family":"Matuura","sequence":"first","affiliation":[]},{"given":"Tomomi","family":"Matsui","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,17]]},"reference":[{"key":"17_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/3-540-44436-X_5","volume-title":"Proc. of APPROX 2000","author":"A. Ageev","year":"2000","unstructured":"A. Ageev, R. Hassin and M. Sviridenko, \u201cAn approximation algorithm for MAX DICUT with given sizes of parts\u201d, Proc. of APPROX 2000, LNCS 1913(2000), 34\u201341."},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1137\/0805002","volume":"5","author":"F. Alizadeh","year":"1995","unstructured":"F. Alizadeh, \u201cInterior point methods in semidefinite programming with applications to combinatorial optimization\u201d, SIAM Journal on Optimization, 5(1995), 13\u201351.","journal-title":"SIAM Journal on Optimization"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"U. Feige and L. Lov\u00e1sz, \u201cTwo-prover one-round proof systems: Their power and their problems\u201d, Proc. of the 24th Annual ACM Symposium on the Theory of Computing, 1992, 733\u2013744.","DOI":"10.1145\/129712.129783"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"U. Feige and M. X. Goemans, \u201cApproximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT\u201d, Proc. of 3rd Israel Symposium on the Theory of Computing and Systems, 182\u2013189, 1995.","DOI":"10.1109\/ISTCS.1995.377033"},{"key":"17_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, \u201cImproved approximation algorithms for maximum cut and satisfiability problems Using Semidefinite Programming\u201d, Journal of the ACM, 42(1995), 1115\u20131145.","journal-title":"Journal of the ACM"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","volume":"25","author":"L. Lov\u00e1sz","year":"1979","unstructured":"L. Lov\u00e1sz, \u201cOn the Shannon capacity of a graph\u201d, IEEE Transactions on Information Theory, 25(1979), 1\u20137.","journal-title":"IEEE Transactions on Information Theory"},{"key":"17_CR7","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970791","volume-title":"Interior point polynomial methods in convex programming","author":"Y. Nesterov","year":"1994","unstructured":"Y. Nesterov and A. Nemirovskii Interior point polynomial methods in convex programming, SIAM Publications, SIAM, Philadelphia, USA, 1994."},{"key":"17_CR8","unstructured":"U. Zwick, \u201cAnalyzing the MAX 2-SAT and MAX DI-CUT approximation algorithms of Feige and Goemans\u201d, currently available from http:\/\/www.math.tau.ac.il\/~zwick\/my-online-papers.html"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44666-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T13:26:22Z","timestamp":1556371582000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44666-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424703","9783540446668"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-44666-4_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}