{"id":"https://openalex.org/W2144347128","doi":"https://doi.org/10.1145/2462356.2462401","title":"Diverse near neighbor problem","display_name":"Diverse near neighbor problem","publication_year":2013,"publication_date":"2013-06-17","ids":{"openalex":"https://openalex.org/W2144347128","doi":"https://doi.org/10.1145/2462356.2462401","mag":"2144347128"},"language":"en","primary_location":{"id":"doi:10.1145/2462356.2462401","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2462356.2462401","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-ninth annual symposium on Computational geometry","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/1721.1/87000","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5013259491","display_name":"Sofiane Abbar","orcid":"https://orcid.org/0000-0002-2819-8691"},"institutions":[{"id":"https://openalex.org/I4210138380","display_name":"Qatar Cardiovascular Research Center","ror":"https://ror.org/038vyt185","country_code":"QA","type":"healthcare","lineage":["https://openalex.org/I4210138380"]}],"countries":["QA"],"is_corresponding":false,"raw_author_name":"Sofiane Abbar","raw_affiliation_strings":["QCRI, Doha, Qatar","QCRI Doha, Qatar#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"QCRI, Doha, Qatar","institution_ids":["https://openalex.org/I4210138380"]},{"raw_affiliation_string":"QCRI Doha, Qatar#TAB#","institution_ids":["https://openalex.org/I4210138380"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081664259","display_name":"Sihem Amer-Yahia","orcid":"https://orcid.org/0000-0002-6194-4502"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Sihem Amer-Yahia","raw_affiliation_strings":["CNRS, LIG, Paris, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CNRS, LIG, Paris, France","institution_ids":["https://openalex.org/I1294671590"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076056716","display_name":"Piotr Indyk","orcid":null},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]},{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Piotr Indyk","raw_affiliation_strings":["MIT, Cambridge, MA, USA","MIT, Cambridge MA, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MIT, Cambridge, MA, USA","institution_ids":["https://openalex.org/I4210110987"]},{"raw_affiliation_string":"MIT, Cambridge MA, USA#TAB#","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065331345","display_name":"Sepideh Mahabadi","orcid":"https://orcid.org/0000-0001-5004-8991"},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]},{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sepideh Mahabadi","raw_affiliation_strings":["MIT, Cambridge, MA, USA","MIT, Cambridge MA, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MIT, Cambridge, MA, USA","institution_ids":["https://openalex.org/I4210110987"]},{"raw_affiliation_string":"MIT, Cambridge MA, USA#TAB#","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113712448","display_name":"Kasturi Varadarajan","orcid":null},"institutions":[{"id":"https://openalex.org/I4210152877","display_name":"Iowa Policy Project","ror":"https://ror.org/04z7s6c33","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I4210152877"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kasturi R. Varadarajan","raw_affiliation_strings":["U Iowa, Iowa City, IA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"U Iowa, Iowa City, IA, USA","institution_ids":["https://openalex.org/I4210152877"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.4148,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.90804548,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"207","last_page":"214"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9955000281333923,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.7253955006599426},{"id":"https://openalex.org/keywords/linear-space","display_name":"Linear space","score":0.5332084894180298},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.5326257348060608},{"id":"https://openalex.org/keywords/hamming-space","display_name":"Hamming space","score":0.5096707344055176},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4616014361381531},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.46115756034851074},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4505416452884674},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.44405263662338257},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.43333080410957336},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4009816348552704},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3986041843891144},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3873395025730133}],"concepts":[{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.7253955006599426},{"id":"https://openalex.org/C176370821","wikidata":"https://www.wikidata.org/wiki/Q1826459","display_name":"Linear space","level":2,"score":0.5332084894180298},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5326257348060608},{"id":"https://openalex.org/C2779494224","wikidata":"https://www.wikidata.org/wiki/Q5645799","display_name":"Hamming space","level":5,"score":0.5096707344055176},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4616014361381531},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.46115756034851074},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4505416452884674},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.44405263662338257},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.43333080410957336},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4009816348552704},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3986041843891144},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3873395025730133},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2462356.2462401","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2462356.2462401","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-ninth annual symposium on Computational geometry","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-00923544v1","is_oa":false,"landing_page_url":"https://hal.science/hal-00923544","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SoCG 2013 - Symposium on Computational Geometry, Jun 2013, Rio de Janeiro, Brazil. pp.207-214, ⟨10.1145/2462356.2462401⟩","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:dspace.mit.edu:1721.1/87000","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/87000","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"MIT web domain","raw_type":"http://purl.org/eprint/type/ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:dspace.mit.edu:1721.1/87000","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/87000","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"MIT web domain","raw_type":"http://purl.org/eprint/type/ConferencePaper"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306079","display_name":"David and Lucile Packard Foundation","ror":"https://ror.org/032atxq54"},{"id":"https://openalex.org/F4320324281","display_name":"Center for Massive Data Algorithmics","ror":"https://ror.org/00qbzpp62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W63372479","https://openalex.org/W1493472025","https://openalex.org/W1562565457","https://openalex.org/W1859467588","https://openalex.org/W1973264045","https://openalex.org/W1995913408","https://openalex.org/W2048872516","https://openalex.org/W2097860522","https://openalex.org/W2099799055","https://openalex.org/W2105997659","https://openalex.org/W2107214735","https://openalex.org/W2139959487","https://openalex.org/W2146796751","https://openalex.org/W2146832283","https://openalex.org/W2152228468","https://openalex.org/W2155229861","https://openalex.org/W2155912844","https://openalex.org/W2164513958","https://openalex.org/W2247953682","https://openalex.org/W2397770138","https://openalex.org/W3024631166","https://openalex.org/W6690901460"],"related_works":["https://openalex.org/W2371167013","https://openalex.org/W2182731056","https://openalex.org/W2613408642","https://openalex.org/W4235868261","https://openalex.org/W1519122282","https://openalex.org/W1503555387","https://openalex.org/W2140899540","https://openalex.org/W2169207476","https://openalex.org/W4380994333","https://openalex.org/W2158117886"],"abstract_inverted_index":{"Motivated":[0],"by":[1,52],"the":[2,10,28,37,53,65,73,76,98,105,121,137,144],"recent":[3],"research":[4],"on":[5],"diversity-aware":[6],"search,":[7],"we":[8],"investigate":[9],"k-diverse":[11],"near":[12],"neighbor":[13],"reporting":[14],"problem.":[15],"The":[16,44],"problem":[17],"is":[18,50,132],"defined":[19],"as":[20,102,104],"follows:":[21],"given":[22],"a":[23,47,80,129],"query":[24,87,117,130],"point":[25],"q,":[26],"report":[27],"maximum":[29],"diversity":[30,45,99],"set":[31,48],"S":[32,49],"of":[33,39,46,59,111,123,139,148],"k":[34],"points":[35,60,77,124],"in":[36,61,79,92,97,134],"ball":[38],"radius":[40],"r":[41,127],"around":[42],"q.":[43],"measured":[51],"minimum":[54],"distance":[55,126],"between":[56],"any":[57],"pair":[58],"$S$":[62],"(the":[63],"higher,":[64],"better).":[66],"We":[67],"present":[68],"two":[69],"approximation":[70],"algorithms":[71,85,114,147],"for":[72],"case":[74],"where":[75],"live":[78],"d-dimensional":[81],"Hamming":[82],"space.":[83],"Our":[84],"guarantee":[86],"times":[88,118],"that":[89,151],"are":[90,143],"sub-linear":[91,116],"n":[93],"and":[94],"only":[95],"polynomial":[96],"parameter":[100],"k,":[101,112],"well":[103],"dimension":[106],"d.":[107],"For":[108],"low":[109],"values":[110],"our":[113,140],"achieve":[115],"even":[119],"if":[120],"number":[122],"within":[125],"from":[128],"$q$":[131],"linear":[133],"$n$.":[135],"To":[136],"best":[138],"knowledge,":[141],"these":[142],"first":[145],"known":[146],"this":[149],"type":[150],"offer":[152],"provable":[153],"guarantees.":[154]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}