{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:45Z","timestamp":1740122445265,"version":"3.37.3"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Beijing Excellent Talents Funding","award":["2014000020124G046"],"award-info":[{"award-number":["2014000020124G046"]}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["06446"],"award-info":[{"award-number":["06446"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["11501412","11531014"],"award-info":[{"award-number":["11501412","11531014"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["11871081"],"award-info":[{"award-number":["11871081"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100015642","name":"Higher Educational Science and Technology Program of Shandong Province","doi-asserted-by":"crossref","award":["J15LN22"],"award-info":[{"award-number":["J15LN22"]}],"id":[{"id":"10.13039\/501100015642","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2021,10]]},"DOI":"10.1007\/s10878-018-0369-4","type":"journal-article","created":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:48:19Z","timestamp":1546303699000},"page":"373-395","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A spectral partitioning algorithm for maximum directed cut problem"],"prefix":"10.1007","volume":"42","author":[{"given":"Zhenning","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donglei","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chenchen","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dachuan","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongmei","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,1,1]]},"reference":[{"key":"369_CR1","doi-asserted-by":"publisher","DOI":"10.5948\/UPO9780883859216","volume-title":"An introduction to inequalities","author":"E Beckenbach","year":"1961","unstructured":"Beckenbach E, Bellman R (1961) An introduction to inequalities. Random House, New York"},{"key":"369_CR2","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s00453-013-9806-z","volume":"71","author":"U Feige","year":"2015","unstructured":"Feige U, Jozeph S (2015) Oblivious algorithms for the maximum directed cut problem. Algorithmica 71:409\u2013428","journal-title":"Algorithmica"},{"key":"369_CR3","doi-asserted-by":"publisher","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:1115\u20131145","journal-title":"J ACM"},{"key":"369_CR4","unstructured":"Kale S, Seshadhri C (2010) Combinatorial approximation algorithms for MaxCut using random walks (preprint). arXiv:1008.3938"},{"key":"369_CR5","doi-asserted-by":"crossref","unstructured":"Lewin M, Livnat D, Zwick U (2002) Improved rounding techniques for the MAX $$2$$-SAT and MAX DI-CUT problems. In: Proceedings of the 9th international conference on integer programming and combinatorial optimization, pp 67\u201382","DOI":"10.1007\/3-540-47867-1_6"},{"key":"369_CR6","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1016\/j.laa.2016.04.019","volume":"504","author":"V Nikiforov","year":"2016","unstructured":"Nikiforov V (2016) Max $$k$$-cut and the smallest eigenvalue. Linear Algebra Appl 504:462\u2013467","journal-title":"Linear Algebra Appl"},{"key":"369_CR7","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1137\/14099098X","volume":"29","author":"A Soto","year":"2015","unstructured":"Soto A (2015) Improved analysis of Max-Cut algorithm based on spectral partitioning. SIAM J Discrete Math 29:259\u2013268","journal-title":"SIAM J Discrete Math"},{"key":"369_CR8","doi-asserted-by":"publisher","first-page":"1769","DOI":"10.1137\/090773714","volume":"41","author":"L Trevisan","year":"2012","unstructured":"Trevisan L (2012) Max cut and the smallest eigenvalue. SIAM J Comput 41:1769\u20131786","journal-title":"SIAM J Comput"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0369-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-018-0369-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0369-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,30]],"date-time":"2021-10-30T06:31:04Z","timestamp":1635575464000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-018-0369-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,1]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,10]]}},"alternative-id":["369"],"URL":"https:\/\/doi.org\/10.1007\/s10878-018-0369-4","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2019,1,1]]},"assertion":[{"value":"1 January 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}