{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,28]],"date-time":"2024-03-28T11:16:21Z","timestamp":1711624581392},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,4,2]],"date-time":"2010-04-02T00:00:00Z","timestamp":1270166400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1007\/s10878-010-9318-6","type":"journal-article","created":{"date-parts":[[2010,4,1]],"date-time":"2010-04-01T15:21:26Z","timestamp":1270135286000},"page":"52-64","source":"Crossref","is-referenced-by-count":6,"title":["Online maximum directed cut"],"prefix":"10.1007","volume":"24","author":[{"given":"Amotz","family":"Bar-Noy","sequence":"first","affiliation":[]},{"given":"Michael","family":"Lampis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,4,2]]},"reference":[{"key":"9318_CR1","doi-asserted-by":"crossref","DOI":"10.1002\/0471722154","volume-title":"The probabilistic method","author":"N Alon","year":"2004","unstructured":"Alon N, Spencer JH (2004) The probabilistic method. Wiley, New York"},{"issue":"3","key":"9318_CR2","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1016\/j.jda.2007.02.002","volume":"6","author":"C Bazgan","year":"2008","unstructured":"Bazgan C, Tuza Z (2008) Combinatorial 5\/6-approximation of max cut in graphs of maximum degree 3. J\u00a0Discrete Algorithms 6(3):510\u2013519","journal-title":"J\u00a0Discrete Algorithms"},{"key":"9318_CR3","doi-asserted-by":"crossref","unstructured":"Feige U, Goemans M (1995) Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT. In: Proceedings of the third Israel symposium on the theory of computing and systems, pp 182\u2013189","DOI":"10.1109\/ISTCS.1995.377033"},{"issue":"6","key":"9318_CR4","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"MX Goemans","year":"1995","unstructured":"Goemans MX, Williamson DP (1995) Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J ACM 42(6):1115\u20131145","journal-title":"J ACM"},{"key":"9318_CR5","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1137\/0204019","volume":"4","author":"F Hadlock","year":"1975","unstructured":"Hadlock F (1975) Finding a maximum cut of a planar graph in polynomial time. SIAM J Comput 4:221","journal-title":"SIAM J Comput"},{"key":"9318_CR6","first-page":"1","volume-title":"Proceedings of the twelfth annual ACM-SIAM symposium on discrete algorithms","author":"E Halperin","year":"2001","unstructured":"Halperin E, Zwick U (2001) Combinatorial approximation algorithms for the maximum directed cut problem. In: Proceedings of the twelfth annual ACM-SIAM symposium on discrete algorithms. Society for Industrial and Applied Mathematics, Philadelphia, pp 1\u20137"},{"key":"9318_CR7","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of computer computations","author":"RM Karp","year":"1972","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of computer computations. Plenum, New York, pp 85\u2013103"},{"key":"9318_CR8","doi-asserted-by":"crossref","unstructured":"Khot S, Kindler G, Mossel E, O\u2019Donnell R (2004) Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? In: Foundations of computer science, 2004. Proceedings. 45th annual IEEE symposium, pp 146\u2013154","DOI":"10.1109\/FOCS.2004.49"},{"key":"9318_CR9","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1007\/978-3-540-92182-0_22","volume-title":"ISAAC","author":"M Lampis","year":"2008","unstructured":"Lampis M, Kaouri G, Mitsou V (2008) On the algorithmic effectiveness of digraph decompositions and complexity measures. In: Hong S-H, Nagamochi H, Fukunaga T (eds) ISAAC. Lecture notes in computer science, vol 5369. Springer, Berlin, pp 220\u2013231"},{"issue":"3","key":"9318_CR10","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"CH Papadimitriou","year":"1991","unstructured":"Papadimitriou CH, Yannakakis M (1991) Optimization, approximation, and complexity classes. J Comput Syst Sci 43(3):425\u2013440","journal-title":"J Comput Syst Sci"},{"key":"9318_CR11","doi-asserted-by":"crossref","unstructured":"Poljak S, Tuza Z (1995) Maximum cuts and large bipartite subgraphs. In: Combinatorial optimization. Papers from the DIMACS special year, pp 181\u2013224","DOI":"10.1090\/dimacs\/020\/04"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9318-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-010-9318-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9318-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:16Z","timestamp":1559276296000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-010-9318-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4,2]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["9318"],"URL":"https:\/\/doi.org\/10.1007\/s10878-010-9318-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,4,2]]}}}