{"id":"https://openalex.org/W4401189978","doi":"https://doi.org/10.1137/23m1568351","title":"Economical Convex Coverings and Applications","display_name":"Economical Convex Coverings and Applications","publication_year":2024,"publication_date":"2024-07-31","ids":{"openalex":"https://openalex.org/W4401189978","doi":"https://doi.org/10.1137/23m1568351"},"language":"en","primary_location":{"id":"doi:10.1137/23m1568351","is_oa":false,"landing_page_url":"https://doi.org/10.1137/23m1568351","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5022760571","display_name":"Sunil Arya","orcid":"https://orcid.org/0000-0003-0939-4192"},"institutions":[{"id":"https://openalex.org/I200769079","display_name":"Hong Kong University of Science and Technology","ror":"https://ror.org/00q4vv597","country_code":"HK","type":"education","lineage":["https://openalex.org/I200769079"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Sunil Arya","raw_affiliation_strings":["Department of Computer Science and Engineering, The Hong Kong University of Science and Technology, Hong Kong","HKUST - Hong Kong University of Science and Technology (Clear Water Bay Kowloon Hong Kong - Hong Kong SAR China)"],"raw_orcid":"https://orcid.org/0000-0003-0939-4192","affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, The Hong Kong University of Science and Technology, Hong Kong","institution_ids":["https://openalex.org/I200769079"]},{"raw_affiliation_string":"HKUST - Hong Kong University of Science and Technology (Clear Water Bay Kowloon Hong Kong - Hong Kong SAR China)","institution_ids":["https://openalex.org/I200769079"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013407008","display_name":"Guilherme D. da Fonseca","orcid":"https://orcid.org/0000-0002-9807-028X"},"institutions":[{"id":"https://openalex.org/I21491767","display_name":"Aix-Marseille Universit\u00e9","ror":"https://ror.org/035xkbk20","country_code":"FR","type":"education","lineage":["https://openalex.org/I21491767"]},{"id":"https://openalex.org/I4210114274","display_name":"Laboratoire d\u2019Informatique et Syst\u00e8mes","ror":"https://ror.org/0257sgk90","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I143002897","https://openalex.org/I21491767","https://openalex.org/I4210114274"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Guilherme D. da Fonseca","raw_affiliation_strings":["Aix-Marseille Universit\u00e9 and LIS Lab, Marseille, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Aix-Marseille Universit\u00e9 and LIS Lab, Marseille, France","institution_ids":["https://openalex.org/I4210114274","https://openalex.org/I21491767"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016442699","display_name":"David M. Mount","orcid":"https://orcid.org/0000-0002-3290-8932"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David M. Mount","raw_affiliation_strings":["Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, College Park, MD USA"],"raw_orcid":"https://orcid.org/0000-0002-3290-8932","affiliations":[{"raw_affiliation_string":"Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, College Park, MD USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.63,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.71137919,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":"53","issue":"4","first_page":"1002","last_page":"1038"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"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/T10237","display_name":"Cryptography and Data Security","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9965000152587891,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5942348837852478},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42249977588653564},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3970748484134674},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.39407411217689514},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33920615911483765},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32488998770713806},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.11630919575691223}],"concepts":[{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5942348837852478},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42249977588653564},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3970748484134674},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.39407411217689514},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33920615911483765},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32488998770713806},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.11630919575691223}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/23m1568351","is_oa":false,"landing_page_url":"https://doi.org/10.1137/23m1568351","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:repository.hkust.edu.hk:1783.1-125251","is_oa":false,"landing_page_url":"http://repository.hkust.edu.hk/ir/Record/1783.1-125251","pdf_url":null,"source":{"id":"https://openalex.org/S4306401796","display_name":"Rare & Special e-Zone (The Hong Kong University of Science and Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I200769079","host_organization_name":"Hong Kong University of Science and Technology","host_organization_lineage":["https://openalex.org/I200769079"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"pmh:oai:HAL:hal-04931445v1","is_oa":false,"landing_page_url":"https://hal.science/hal-04931445","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":"SIAM Journal on Computing, 2024, 53 (4), pp.1002-1038. ⟨10.1137/23M1568351⟩","raw_type":"Journal articles"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4121092108","display_name":null,"funder_award_id":"CCF-1618866","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4525706185","display_name":null,"funder_award_id":"ADDS ANR-19-CE48-0005","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G4871431719","display_name":"Algorithms for Multi-Dimensional Data via Sketches","funder_award_id":"ANR-19-CE48-0005","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G7298737130","display_name":"On the Difficulty of Separation","funder_award_id":"16214721","funder_id":"https://openalex.org/F4320321592","funder_display_name":"Research Grants Council, University Grants Committee"},{"id":"https://openalex.org/G8247190471","display_name":"Approximation algorithms for proximity problems with alternative distance measures","funder_award_id":"16213219","funder_id":"https://openalex.org/F4320321592","funder_display_name":"Research Grants Council, University Grants Committee"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"},{"id":"https://openalex.org/F4320321592","display_name":"Research Grants Council, University Grants Committee","ror":"https://ror.org/00djwmt25"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":46,"referenced_works":["https://openalex.org/W117977885","https://openalex.org/W1493472025","https://openalex.org/W1571966798","https://openalex.org/W1612343071","https://openalex.org/W1742003405","https://openalex.org/W1967952322","https://openalex.org/W1981326822","https://openalex.org/W1995232397","https://openalex.org/W2011877429","https://openalex.org/W2021445627","https://openalex.org/W2026129593","https://openalex.org/W2037318282","https://openalex.org/W2046116152","https://openalex.org/W2047308801","https://openalex.org/W2063342497","https://openalex.org/W2070971235","https://openalex.org/W2072611242","https://openalex.org/W2075603209","https://openalex.org/W2086591901","https://openalex.org/W2093079548","https://openalex.org/W2100440346","https://openalex.org/W2114616381","https://openalex.org/W2133465710","https://openalex.org/W2141040012","https://openalex.org/W2290236472","https://openalex.org/W2331166859","https://openalex.org/W2339690594","https://openalex.org/W2606736274","https://openalex.org/W2738786117","https://openalex.org/W2921474644","https://openalex.org/W2963130757","https://openalex.org/W2963756047","https://openalex.org/W2969970306","https://openalex.org/W3014312596","https://openalex.org/W3024390163","https://openalex.org/W3138461027","https://openalex.org/W3202483697","https://openalex.org/W3203598337","https://openalex.org/W4210733153","https://openalex.org/W4213068077","https://openalex.org/W4232705780","https://openalex.org/W4236593626","https://openalex.org/W4241014687","https://openalex.org/W4248139057","https://openalex.org/W4248484045","https://openalex.org/W4295128493"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027","https://openalex.org/W2962838298","https://openalex.org/W2600246793"],"abstract_inverted_index":{"Coverings":[0,60],"of":[1,13,37,50,58,75,103,139,162,171,210,234,276,306,316],"convex":[2,20,25,38,109,120,174,191,311],"bodies":[3,39,110],"have":[4,61],"emerged":[5],"as":[6,68,117],"a":[7,24,32,35,46,142,173,177,189,206,273,301],"central":[8],"component":[9],"in":[10,64,111,153,227,269,282],"the":[11,91,119,123,137,151,154,158,169,180,185,228,260,283,289],"design":[12],"efficient":[14],"solutions":[15],"to":[16,90,100,132,168,232,279,314],"approximation":[17,196],"problems":[18],"involving":[19],"bodies.":[21],"Intuitively,":[22],"given":[23],"body":[26,52,121,175,192,312],"K":[27,43,193,216],"and":[28,73,88,160,194,251,286],"\u03b5":[29,56,198],">":[30,199],"0,":[31,200],"covering":[33],"is":[34,97,122,182,225,248],"collection":[36],"whose":[40],"union":[41],"covers":[42],"such":[44,67,116,141,214],"that":[45,203,215,267],"constant":[47],"factor":[48],"expansion":[49,57],"each":[51],"lies":[53],"within":[54],"an":[55,195,255],"K.":[59],"been":[62,130,239],"employed":[63],"many":[65],"applications,":[66],"approximations":[69,83,89],"for":[70,107,295,303,309],"diameter,":[71],"width,":[72],"\u03b5-kernels":[74],"point":[76],"sets,":[77],"approximate":[78],"nearest":[79],"neighbor":[80],"searching,":[81],"polytope":[82,207],"with":[84,272],"low":[85],"combinatorial":[86],"complexity,":[87],"Closest":[92],"Vector":[93],"Problem":[94],"(CVP).":[95],"it":[96],"known":[98],"how":[99],"construct":[101],"coverings":[102,164,305],"size":[104,308],"nO(n)":[105],"/\u03b5(n-1)/2":[106],"general":[108],"\u211dn.":[112],"In":[113,146],"special":[114],"cases,":[115],"when":[118],"\u2113p":[124],"unit":[125],"ball,":[126],"this":[127,147],"bound":[128,143,224,237],"has":[129,238],"improved":[131],"2O(n)":[133],"/\u03b5(n-1)/2.":[134],"This":[135,223],"raises":[136],"question":[138,152],"whether":[140],"generally":[144],"holds.":[145],"paper":[148],"we":[149,201,258,287],"answer":[150],"affirmative.":[155],"We":[156,298],"demonstrate":[157],"power":[159],"versatility":[161],"our":[163,246],"by":[165,176],"applying":[166],"them":[167],"problem":[170],"approximating":[172],"polytope,":[178],"where":[179],"error":[181],"measured":[183],"through":[184],"Banach-Mazur":[186],"metric.":[187],"Given":[188],"well-centered":[190],"parameter":[197],"show":[202],"there":[204],"exists":[205],"P":[208,218],"consisting":[209],"2O(n)/\u03b5(n-1)/2":[211,277],"vertices":[212],"(facets)":[213],"\u2282":[217,219],"K(1":[220],"+":[221,263,292],"\u03b5).":[222],"optimal":[226,307],"worst":[229],"case":[230],"up":[231,278],"factors":[233,281,315],"2O(n).":[235],"(This":[236],"established":[240],"recently":[241],"using":[242],"different":[243],"techniques,":[244],"but":[245],"approach":[247],"arguably":[249],"simpler":[250],"more":[252],"elegant.)":[253],"As":[254],"additional":[256],"consequence,":[257],"obtain":[259,288],"fastest":[261,290],"(1":[262,291],"\u03b5)-approximate":[264],"CVP":[265],"algorithm":[266,294],"works":[268],"any":[270,310],"norm,":[271],"running":[274],"time":[275],"polynomial":[280],"input":[284],"size,":[285],"\u03b5)-approximation":[293],"integer":[296],"programming.":[297],"also":[299],"present":[300],"framework":[302],"constructing":[304],"(up":[313],"2O(n)).":[317]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1}],"updated_date":"2026-06-22T08:00:12.763002","created_date":"2025-10-10T00:00:00"}