{"id":"https://openalex.org/W2625369867","doi":"https://doi.org/10.1137/16m1070682","title":"Nearly Optimal NP-Hardness of Unique Coverage","display_name":"Nearly Optimal NP-Hardness of Unique Coverage","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2625369867","doi":"https://doi.org/10.1137/16m1070682","mag":"2625369867"},"language":"en","primary_location":{"id":"doi:10.1137/16m1070682","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1070682","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/A5068388812","display_name":"Venkatesan Guruswami","orcid":"https://orcid.org/0000-0001-7926-3396"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Venkatesan Guruswami","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5075423314","display_name":"Euiwoong Lee","orcid":"https://orcid.org/0000-0003-1454-7587"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Euiwoong Lee","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5068388812"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.0970388,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":"46","issue":"3","first_page":"1018","last_page":"1028"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9957000017166138,"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.994700014591217,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.793057918548584},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.738494873046875},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.647156298160553},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.5540381073951721},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5483494400978088},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"Hardness of approximation","score":0.5229676365852356},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5079682469367981},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4945378005504608},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4912824034690857},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.48080721497535706},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.48023682832717896},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47799721360206604},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4555164873600006},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.4450499415397644},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.4323245882987976},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.4284592270851135},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.400814414024353},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.09682855010032654}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.793057918548584},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.738494873046875},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.647156298160553},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.5540381073951721},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5483494400978088},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.5229676365852356},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5079682469367981},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4945378005504608},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4912824034690857},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.48080721497535706},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.48023682832717896},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47799721360206604},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4555164873600006},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.4450499415397644},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.4323245882987976},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.4284592270851135},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.400814414024353},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.09682855010032654},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/16m1070682","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1070682","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7621784418","display_name":null,"funder_award_id":"CCF-1115525","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320332195","display_name":"Samsung","ror":"https://ror.org/04w3jy968"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W2010916800","https://openalex.org/W2059453880","https://openalex.org/W2091602684","https://openalex.org/W2143996311","https://openalex.org/W2611404581","https://openalex.org/W3037538996"],"related_works":["https://openalex.org/W1956536100","https://openalex.org/W2963411648","https://openalex.org/W4297731553","https://openalex.org/W4298059473","https://openalex.org/W2951513093","https://openalex.org/W2403340448","https://openalex.org/W2950625434","https://openalex.org/W4300265938","https://openalex.org/W4388329052","https://openalex.org/W2000333212"],"abstract_inverted_index":{"The":[0],"Unique":[1,103,107],"Coverage":[2],"problem,":[3],"given":[4],"a":[5,11,59,78,118],"universe":[6],"$V$":[7],"of":[8,14,16,28,86,139],"elements":[9],"and":[10,57,88,179],"collection":[12],"$E$":[13],"subsets":[15],"$V$,":[17],"asks":[18],"to":[19,24,75,115],"find":[20],"$S":[21],"\\subseteq":[22],"V$":[23],"maximize":[25],"the":[26,84,98,102,137,161,176],"number":[27],"$e":[29,41],"\\in":[30,42],"E$":[31,43],"that":[32,69,111],"intersects":[33],"$S$":[34],"in":[35],"exactly":[36],"one":[37],"element.":[38],"When":[39],"each":[40],"has":[44],"cardinality":[45],"at":[46],"most":[47],"$k$,":[48,66],"it":[49,112],"is":[50,73,113],"also":[51],"known":[52],"as":[53],"1-in-$k$":[54,70],"Hitting":[55,71],"Set":[56,72,177],"admits":[58,131],"simple":[60,166],"$\\Omega(\\frac{1}{\\log":[61],"k})$-approximation":[62],"algorithm.":[63],"For":[64,106],"constant":[65],"we":[67,109],"prove":[68,110],"NP-hard":[74],"approximate":[76,116],"within":[77,117],"factor":[79,119],"$O(\\frac{1}{\\log":[80],"k})$.":[81],"This":[82,135],"improves":[83,136],"result":[85,100],"Guruswami":[87],"Zhou":[89],"[Theory":[90],"Comput.,":[91,145],"8":[92],"(2012),":[93],"pp.":[94,148],"239--267],":[95],"who":[96],"proved":[97],"same":[99],"assuming":[101],"Games":[104],"Conjecture.":[105],"Coverage,":[108],"hard":[114],"$O(\\frac{1}{\\log^{1":[120],"-":[121],"\\epsilon}":[122],"n})$":[123],"for":[124,175],"any":[125],"$\\epsilon":[126],">":[127],"0$,":[128],"unless":[129],"NP":[130],"quasi-polynomial":[132],"time":[133],"algorithms.":[134],"results":[138,174],"Demaine":[140],"et":[141],"al.":[142],"[SIAM":[143],"J.":[144],"38":[146],"(2008),":[147],"1464--1483],":[149],"including":[150],"their":[151],"$\\approx":[152],"1/\\log^{1/3}":[153],"n$":[154],"inapproximability":[155,173],"factor,":[156],"which":[157],"was":[158],"proven":[159],"under":[160],"Random":[162],"3SAT":[163],"Hypothesis.":[164],"Our":[165],"proof":[167],"combines":[168],"ideas":[169],"from":[170],"two":[171],"classical":[172],"Cover":[178],"Constraint":[180],"Satisfaction":[181],"Problems,":[182],"made":[183],"efficient":[184],"by":[185],"various":[186],"derandomization":[187],"methods":[188],"based":[189],"on":[190],"bounded":[191],"independence.":[192]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}