{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:30:15Z","timestamp":1743035415335,"version":"3.40.3"},"publisher-location":"Cham","reference-count":8,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319711492"},{"type":"electronic","value":"9783319711508"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-71150-8_26","type":"book-chapter","created":{"date-parts":[[2017,11,16]],"date-time":"2017-11-16T00:48:21Z","timestamp":1510793301000},"page":"298-312","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","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":[[2017,11,17]]},"reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"MX Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42, 1115\u20131145 (1995)","journal-title":"J. ACM"},{"key":"26_CR2","doi-asserted-by":"publisher","first-page":"1769","DOI":"10.1137\/090773714","volume":"41","author":"L Trevisan","year":"2012","unstructured":"Trevisan, L.: Max cut and the smallest eigenvalue. SIAM. Comput. 41, 1769\u20131786 (2012)","journal-title":"SIAM. Comput."},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1137\/14099098X","volume":"29","author":"A Soto","year":"2015","unstructured":"Soto, A.: Improved analysis of max-cut algorithm based on spectral partitioning. SIAM J. Diecrete Math. 29, 259\u2013268 (2015)","journal-title":"SIAM J. Diecrete Math."},{"key":"26_CR4","unstructured":"Kale, S., Seshadhri, C.: Combinatorial approximation algorithms for MaxCut using Random Walks. preprint, arXiv:1008.3938 (2010)"},{"key":"26_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/3-540-47867-1_6","volume-title":"Integer Programming and Combinatorial Optimization","author":"M Lewin","year":"2002","unstructured":"Lewin, M., Livnat, D., Zwick, U.: Improved rounding techniques for the MAX 2-SAT and MAX DI-CUT Problems. In: Cook, W.J., Schulz, A.S. (eds.) IPCO 2002. LNCS, vol. 2337, pp. 67\u201382. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-47867-1_6"},{"key":"26_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.: Max k-cut and the smallest eigenvalue. Linear Algebra Appl. 504, 462\u2013467 (2016)","journal-title":"Linear Algebra Appl."},{"key":"26_CR7","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.: Oblivious algorithms for the maximum directed cut problem. Algorithmica 71, 409\u2013428 (2015)","journal-title":"Algorithmica"},{"key":"26_CR8","doi-asserted-by":"crossref","DOI":"10.5948\/UPO9780883859216","volume-title":"An Introduction to Inequalities","author":"E Beckenbach","year":"1961","unstructured":"Beckenbach, E., Bellman, R.: An Introduction to Inequalities. Random House, New York (1961)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-71150-8_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T13:47:08Z","timestamp":1709819228000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-71150-8_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319711492","9783319711508"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-71150-8_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"17 November 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 December 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 December 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/anl.sjtu.edu.cn\/cocoa2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}