{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:13:03Z","timestamp":1725455583124},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540637578"},{"type":"electronic","value":"9783540696438"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0024489","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T02:30:56Z","timestamp":1132367456000},"page":"78-84","source":"Crossref","is-referenced-by-count":10,"title":["An upper bound for the maximum cut mean value"],"prefix":"10.1007","author":[{"given":"Alberto","family":"Bertoni","sequence":"first","affiliation":[]},{"given":"Paola","family":"Campadelli","sequence":"additional","affiliation":[]},{"given":"Roberto","family":"Posenato","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Francisco Barahona, M. J\u00fcnger, M. Gr\u00f6tschel, and G. Reinelt. An application of combinatorial optimization to statistical physics and circuit layout design. Operations Research, (36):493\u2013513, 1988.","DOI":"10.1287\/opre.36.3.493"},{"issue":"4","key":"8_CR2","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF01275669","volume":"11","author":"J. Friedman","year":"1991","unstructured":"Joel Friedman. On the second eigenvalue and random walks in random d-regular graphs. Combinatorica, 11(4):331\u2013365, 1991.","journal-title":"Combinatorica"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Michel X. Goemans and David P. Williamson..878-approximation algorithms for MAX CUT and MAX 2SAT. In Proceedings of the 26th ACM Symposium on the Theory of Computation, 1994.","DOI":"10.1145\/195058.195216"},{"issue":"3","key":"8_CR4","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1137\/0204019","volume":"4","author":"F. Hadlock","year":"1975","unstructured":"F. Hadlock. Finding a maximum cut of a planar graph in polynomial time. SIAM Journal on Computing, 4(3):221\u2013225, September 1975.","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"8_CR5","doi-asserted-by":"crossref","first-page":"724","DOI":"10.1109\/72.377977","volume":"6","author":"A. Jagota","year":"1995","unstructured":"Arun Jagota. Approximating maximum clique with a Hopfield network. IEEE Transactions on Neural Networks, 6(3):724\u2013735, May 1995.","journal-title":"IEEE Transactions on Neural Networks"},{"key":"8_CR6","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R. M. Karp","year":"1972","unstructured":"Richard M. Karp. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations, pages 85\u2013103, New York, 1972. Plenum Press."},{"key":"8_CR7","series-title":"Technical Report","volume-title":"Effect of conectivity in associative memory models","author":"J. Komlos","year":"1988","unstructured":"J. Komlos and R. Paturi. Effect of conectivity in associative memory models. Technical Report CS88-131, University of California. San Diego, August 1988."},{"issue":"3","key":"8_CR8","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S. Sahni","year":"1976","unstructured":"Sartaj Sahni and Teofilo Gonzalez. P-Complete Approximation Problems. Journal of the ACM, 23(3):555\u2013565, July 1976.","journal-title":"Journal of the ACM"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Johan H\u00e5stad. Some optimal in-approximability results. November 1996.","DOI":"10.1145\/258533.258536"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0024489","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T21:35:31Z","timestamp":1586554531000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0024489"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540637578","9783540696438"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/bfb0024489","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}