{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T10:37:37Z","timestamp":1769164657350,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,5,9]],"date-time":"2017-05-09T00:00:00Z","timestamp":1494288000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1343976 1443858 1624074"],"award-info":[{"award-number":["1343976 1443858 1624074"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Microsoft Research"},{"name":"Qatar National Research","award":["07-794-1-145"],"award-info":[{"award-number":["07-794-1-145"]}]},{"name":"Army Research Office","award":["W911NF-15-1-0020"],"award-info":[{"award-number":["W911NF-15-1-0020"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,5,9]]},"DOI":"10.1145\/3035918.3035932","type":"proceedings-article","created":{"date-parts":[[2017,5,10]],"date-time":"2017-05-10T18:09:00Z","timestamp":1494439740000},"page":"821-834","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":41,"title":["Efficient Computation of Regret-ratio Minimizing Set"],"prefix":"10.1145","author":[{"given":"Abolfazl","family":"Asudeh","sequence":"first","affiliation":[{"name":"University of Texas at Arlington, Arlington, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Azade","family":"Nazi","sequence":"additional","affiliation":[{"name":"University of Texas at Arlington, Arlington, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nan","family":"Zhang","sequence":"additional","affiliation":[{"name":"George Washington University, Washington, DC, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gautam","family":"Das","sequence":"additional","affiliation":[{"name":"University of Texas at Arlington, Arlington, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,5,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/358315.358392"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/645484.656550"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/568518.568519"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142530"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335433"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732269.2732275"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.4.3.233"},{"key":"e_1_3_2_1_8_1","volume-title":"Linear programming and extensions","author":"Dantzig G. B.","year":"1998","unstructured":"G. B. Dantzig . Linear programming and extensions . Princeton university press , 1998 . G. B. Dantzig. Linear programming and extensions. Princeton university press, 1998."},{"key":"e_1_3_2_1_9_1","volume-title":"VLDB","author":"Das G.","year":"2006","unstructured":"G. Das , D. Gunopulos , N. Koudas , and D. Tsirogiannis . Answering top-k queries using views . In VLDB , 2006 . G. Das, D. Gunopulos, N. Koudas, and D. Tsirogiannis. Answering top-k queries using views. In VLDB, 2006."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480102412856"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00026-6"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"e_1_3_2_1_13_1","volume-title":"On the expected complexity of random convex hulls. arXiv preprint arXiv:1111.5340","author":"Har-Peled S.","year":"2011","unstructured":"S. Har-Peled . On the expected complexity of random convex hulls. arXiv preprint arXiv:1111.5340 , 2011 . S. Har-Peled. On the expected complexity of random convex hulls. arXiv preprint arXiv:1111.5340, 2011."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2012.07.001"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-003-0099-8"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2014.01.022"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/2831360.2831364"},{"key":"e_1_3_2_1_18_1","volume-title":"Force-directed drawing algorithms","author":"Kobourov S. G.","year":"2004","unstructured":"S. G. Kobourov . Force-directed drawing algorithms . 2004 . S. G. Kobourov. Force-directed drawing algorithms. 2004."},{"key":"e_1_3_2_1_19_1","volume-title":"TKDE","author":"Lee J.","year":"2014","unstructured":"J. Lee , H. Cho , S. Lee , and S.-w. Hwang . Toward scalable indexing for top-k queries . TKDE , 2014 . J. Lee, H. Cho, S. Lee, and S.-w. Hwang. Toward scalable indexing for top-k queries. TKDE, 2014."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1005566.1005569"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/2983200.2983205"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920980"},{"key":"e_1_3_2_1_23_1","volume-title":"IPCO","author":"Nobili P.","year":"1992","unstructured":"P. Nobili and A. Sassano . A separation routine for the set covering polytope . In IPCO , 1992 . P. Nobili and A. Sassano. A separation routine for the set covering polytope. In IPCO, 1992."},{"key":"e_1_3_2_1_24_1","volume-title":"Artificial intelligence: a modern approach","author":"Russell S. J.","year":"2003","unstructured":"S. J. Russell , P. Norvig , J. F. Canny , J. M. Malik , and D. D. Edwards . Artificial intelligence: a modern approach , volume 2 . Prentice hall Upper Saddle River , 2003 . S. J. Russell, P. Norvig, J. F. Canny, J. M. Malik, and D. D. Edwards. Artificial intelligence: a modern approach, volume 2. Prentice hall Upper Saddle River, 2003."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s3-13.1.743"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2010.03.008"},{"key":"e_1_3_2_1_27_1","volume-title":"Stochastic geometry, handbook of convex geometry","author":"Weil W.","year":"1993","unstructured":"W. Weil and J. Wieacker . Stochastic geometry, handbook of convex geometry , vol. a, b, 1391-- 1438 , 1993 . W. Weil and J. Wieacker. Stochastic geometry, handbook of convex geometry, vol. a, b, 1391--1438, 1993."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.14778\/2904483.2904491"},{"key":"e_1_3_2_1_29_1","volume-title":"VLDB","author":"Xin D.","year":"2006","unstructured":"D. Xin , C. Chen , and J. Han . Towards robust indexing for ranked queries . In VLDB , 2006 . D. Xin, C. Chen, and J. Han. Towards robust indexing for ranked queries. In VLDB, 2006."}],"event":{"name":"SIGMOD\/PODS'17: International Conference on Management of Data","location":"Chicago Illinois USA","acronym":"SIGMOD\/PODS'17","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2017 ACM International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3035918.3035932","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3035918.3035932","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3035918.3035932","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:36:48Z","timestamp":1750217808000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3035918.3035932"}},"subtitle":["A Compact Maxima Representative"],"short-title":[],"issued":{"date-parts":[[2017,5,9]]},"references-count":29,"alternative-id":["10.1145\/3035918.3035932","10.1145\/3035918"],"URL":"https:\/\/doi.org\/10.1145\/3035918.3035932","relation":{},"subject":[],"published":{"date-parts":[[2017,5,9]]},"assertion":[{"value":"2017-05-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}