{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,17]],"date-time":"2023-10-17T20:31:24Z","timestamp":1697574684324},"reference-count":12,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"tdm","delay-in-days":5722,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Random Struct. Alg."],"published-print":{"date-parts":[[2000,7]]},"DOI":"10.1002\/1098-2418(200007)16:4<314::aid-rsa2>3.0.co;2-e","type":"journal-article","created":{"date-parts":[[2002,8,25]],"date-time":"2002-08-25T19:43:55Z","timestamp":1030304635000},"page":"314-332","source":"Crossref","is-referenced-by-count":9,"title":["Polynomial time approximation of dense weighted instances of MAX-CUT"],"prefix":"10.1002","volume":"16","author":[{"given":"W.","family":"Fernandez de la Vega","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Karpinski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2000]]},"reference":[{"key":"10.1002\/1098-2418(200007)16:4<314::AID-RSA2>3.0.CO;2-E-BIB1","author":"Arora","year":"1996","unstructured":"and A new rounding procedure for the assignment problem with applications to dense graph arrangements, Proc Thirty-Seventh IEEE Symposium on Foundations of Computer Science, 1996, pp. 21-30."},{"key":"10.1002\/1098-2418(200007)16:4<314::AID-RSA2>3.0.CO;2-E-BIB2","author":"Arora","year":"1995","unstructured":"and Polynomial time approximation schemes for dense instances of NP-hard problems, Proc Twenty-Seventh Association for Computing Machinery ACM Symposium on Theory of Computing, 1995, pp. 284-293."},{"key":"10.1002\/1098-2418(200007)16:4<314::AID-RSA2>3.0.CO;2-E-BIB3","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0020-0190(97)00164-6","volume":"64","author":"Cesati","year":"1997","journal-title":"Inf Process Lett"},{"key":"10.1002\/1098-2418(200007)16:4<314::AID-RSA2>3.0.CO;2-E-BIB4","author":"Crescensi","year":"1996","unstructured":"and To weight or not to weight: Where is the question? Proc IEEE, ISTCS'96, 1996."},{"key":"10.1002\/1098-2418(200007)16:4<314::AID-RSA2>3.0.CO;2-E-BIB5","volume-title":"An introduction to probability theory and its applications","volume":"2","author":"Feller","year":"1963","unstructured":"An introduction to probability theory and its applications, Wiley, New York, 1963, Vol. 2."},{"key":"10.1002\/1098-2418(200007)16:4<314::AID-RSA2>3.0.CO;2-E-BIB6","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1002\/(SICI)1098-2418(199605)8:3<187::AID-RSA3>3.0.CO;2-U","volume":"8","author":"Fernandez de la Vega","year":"1996","journal-title":"Random Struct Algorithms"},{"key":"10.1002\/1098-2418(200007)16:4<314::AID-RSA2>3.0.CO;2-E-BIB7","author":"Frieze","year":"1996","unstructured":"and The regularity lemma and approximation schemes for dense problems, Proc Thirty-Seventh IEEE Symposium on Foundations of Computer Science, 1996, pp. 12-20."},{"key":"10.1002\/1098-2418(200007)16:4<314::AID-RSA2>3.0.CO;2-E-BIB8","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/s004930050052","volume":"19","author":"Frieze","year":"1999","journal-title":"Combinatorica"},{"key":"10.1002\/1098-2418(200007)16:4<314::AID-RSA2>3.0.CO;2-E-BIB9","volume-title":"Computers and intractability, A guide to the theory of NP-completeness","author":"Garey","year":"1979","unstructured":"and Computers and intractability, A guide to the theory of NP-completeness, Freeman, San Francisco, CA, 1979."},{"key":"10.1002\/1098-2418(200007)16:4<314::AID-RSA2>3.0.CO;2-E-BIB10","author":"Goldreich","year":"1996","unstructured":"and Property testing and its connection to learning and approximation, Proc Thirty-Seventh IEEE Symposium on Foundations of Computer Science, 1996."},{"key":"10.1002\/1098-2418(200007)16:4<314::AID-RSA2>3.0.CO;2-E-BIB11","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"Hoeffding","year":"1963","journal-title":"J Am Stat Assoc"},{"key":"10.1002\/1098-2418(200007)16:4<314::AID-RSA2>3.0.CO;2-E-BIB12","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"Papadimitriou","year":"1991","journal-title":"J Comput Syst Sci"}],"container-title":["Random Structures and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2F1098-2418(200007)16:4%3C314::AID-RSA2%3E3.0.CO;2-E","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full\/10.1002\/1098-2418(200007)16:4%3C314::AID-RSA2%3E3.0.CO;2-E","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T03:23:08Z","timestamp":1625109788000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/1098-2418(200007)16:4<314::AID-RSA2>3.0.CO;2-E"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2000,7]]}},"URL":"https:\/\/doi.org\/10.1002\/1098-2418(200007)16:4<314::aid-rsa2>3.0.co;2-e","relation":{},"ISSN":["1042-9832","1098-2418"],"issn-type":[{"value":"1042-9832","type":"print"},{"value":"1098-2418","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000]]}}}