{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:33:06Z","timestamp":1725485586287},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540651420"},{"type":"electronic","value":"9783540495437"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-49543-6_28","type":"book-chapter","created":{"date-parts":[[2007,6,6]],"date-time":"2007-06-06T22:58:05Z","timestamp":1181170685000},"page":"357-368","source":"Crossref","is-referenced-by-count":2,"title":["Sampling Methods Applied to Dense Instances of Non-Boolean Optimization Problems"],"prefix":"10.1007","author":[{"given":"Gunnar","family":"Andersson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lars","family":"Engebretsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,6,11]]},"reference":[{"key":"28_CR1","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1145\/225058.225140","volume-title":"Proc. Twenty-seventh Ann. ACM Symp. on Theory of Comp.","author":"S. Arora","year":"1995","unstructured":"Sanjeev Arora, David Karger, and Marek Karpinski. Polynomial time approximation schemes for dense instances of NP-hard problems. In Proc. Twenty-seventh Ann. ACM Symp. on Theory of Comp., pages 284\u2013293. ACM, New York, 1995."},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"357","DOI":"10.2748\/tmj\/1178243286","volume":"19","author":"K. Azuma","year":"1967","unstructured":"Kazuoki Azuma. Weighted sums of certain dependent random variables. T\u00d4hoku Mathematical Journal, 19:357\u2013367, 1967.","journal-title":"T\u00d4hoku Mathematical Journal"},{"key":"28_CR3","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1002\/(SICI)1098-2418(199608\/09)9:1\/2<93::AID-RSA6>3.0.CO;2-6","volume":"9","author":"W. F. Vega de la","year":"1996","unstructured":"Wenceslas Fernandez de la Vega. MAX-CUT has a randomized approximation scheme in dense graphs. Random Structures and Algorithms, 9:93\u201397, 1996.","journal-title":"Random Structures and Algorithms"},{"key":"28_CR4","unstructured":"Alan Frieze and Ravi Kannan. Quick approximation to matrices and applications. Manuscript, July 1997."},{"key":"28_CR5","first-page":"339","volume-title":"Proc. of 37th Ann. IEEE Symp. on Foundations of Comput. Sci.","author":"O. Goldreich","year":"1996","unstructured":"Oded Goldreich, Shafi Goldwasser, and Dana Ron. Property testing and its connection to learning and approximation. In Proc. of 37th Ann. IEEE Symp. on Foundations of Comput. Sci., pages 339\u2013348. IEEE Computer Society, Los Alamitos, 1996."},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/258533.258536","volume-title":"Proc. Twenty-ninth Ann. ACM Symp. on Theory of Comp.","author":"J. H\u00e5stad","year":"1997","unstructured":"Johan H\u00e5stad. Some optimal inapproximability results. In Proc. Twenty-ninth Ann. ACM Symp. on Theory of Comp., pages 1\u201310. ACM, New York, 1997."},{"key":"28_CR7","doi-asserted-by":"publisher","first-page":"13","DOI":"10.2307\/2282952","volume":"58","author":"W. Hoeffding","year":"1963","unstructured":"Wassily Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58:13\u201330, 1963.","journal-title":"Journal of the American Statistical Association"},{"key":"28_CR8","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Rajeev Motwani and Prabhakar Raghavan. Randomized Algorithms. Cambridge University Press, Cambridge, 1995."},{"key":"28_CR9","volume-title":"Computational Complexity","author":"C. H. Papadimitriou","year":"1994","unstructured":"Christos H. Papadimitriou. Computational Complexity. AddisonWestley, Reading, 1994."},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1145\/276698.276869","volume-title":"Proc. Thirtieth Ann. ACM Symp. on Theory of Comp.","author":"U. Zwick","year":"1998","unstructured":"Uri Zwick. Finding almost-satisfying assignments. In Proc. Thirtieth Ann. ACM Symp. on Theory of Comp., pages 551\u2013560. ACM, New York, 1998."}],"container-title":["Lecture Notes in Computer Science","Randomization and Approximation Techniques in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49543-6_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T01:11:52Z","timestamp":1550365912000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49543-6_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540651420","9783540495437"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-49543-6_28","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}