{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:28:30Z","timestamp":1750307310082,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T00:00:00Z","timestamp":1307318400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,6,6]]},"DOI":"10.1145\/1993636.1993667","type":"proceedings-article","created":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T11:53:52Z","timestamp":1307361232000},"page":"225-234","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Pareto optimal solutions for smoothed analysts"],"prefix":"10.1145","author":[{"given":"Ankur","family":"Moitra","sequence":"first","affiliation":[{"name":"MIT, Cambridge, USA"}]},{"given":"Ryan","family":"O'Donnell","sequence":"additional","affiliation":[{"name":"CMU, Pittsburgh, USA"}]}],"member":"320","published-online":{"date-parts":[[2011,6,6]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.02.034"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72792-7_5"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.04.004"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447268"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/322092.322095"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/645484.656550"},{"key":"e_1_3_2_2_8_1","volume-title":"Lower bounds for the smoothed number of pareto optimal solutions. arXiv:1012.1163","author":"Brunsch T.","year":"2010","unstructured":"T. Brunsch and H. R\u00f6glin . Lower bounds for the smoothed number of pareto optimal solutions. arXiv:1012.1163 , 2010 . T. Brunsch and H. R\u00f6glin. Lower bounds for the smoothed number of pareto optimal solutions. arXiv:1012.1163, 2010."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(89)90156-7"},{"key":"e_1_3_2_2_10_1","volume-title":"Multi-objective optimization using evolutionary algorithms","author":"Deb K.","year":"2001","unstructured":"K. Deb . Multi-objective optimization using evolutionary algorithms . Wiley , 2001 . K. Deb. Multi-objective optimization using evolutionary algorithms. Wiley, 2001."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(80)90036-8"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.14.1.162"},{"key":"e_1_3_2_2_14_1","volume-title":"Multicriteria optimization","author":"Ehrgott M.","year":"2005","unstructured":"M. Ehrgott . Multicriteria optimization . Springer , 2005 . M. Ehrgott. Multicriteria optimization. Springer, 2005."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/800057.808701"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1998.0954"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.15.9.494"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796569"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.21"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-006-0055-7"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/990308.990310"},{"key":"e_1_3_2_2_22_1","unstructured":"S.-H. Teng 2010. National Science Foundation award #0964481.  S.-H. Teng 2010. National Science Foundation award #0964481."}],"event":{"name":"STOC'11: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"San Jose California USA","acronym":"STOC'11"},"container-title":["Proceedings of the forty-third annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993636.1993667","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1993636.1993667","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:00:05Z","timestamp":1750244405000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993636.1993667"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,6]]},"references-count":20,"alternative-id":["10.1145\/1993636.1993667","10.1145\/1993636"],"URL":"https:\/\/doi.org\/10.1145\/1993636.1993667","relation":{},"subject":[],"published":{"date-parts":[[2011,6,6]]},"assertion":[{"value":"2011-06-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}