{"id":"https://openalex.org/W2108967854","doi":"https://doi.org/10.1007/s00453-010-9464-3","title":"Improved Approximation Algorithms for Label Cover Problems","display_name":"Improved Approximation Algorithms for Label Cover Problems","publication_year":2011,"publication_date":"2011-02-02","ids":{"openalex":"https://openalex.org/W2108967854","doi":"https://doi.org/10.1007/s00453-010-9464-3","mag":"2108967854"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-010-9464-3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-010-9464-3","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","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/A5071016611","display_name":"Moses Charikar","orcid":"https://orcid.org/0000-0003-0807-3389"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Moses Charikar","raw_affiliation_strings":["Department of Computer Science, Princeton University, Princeton, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Princeton University, Princeton, USA","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111876448","display_name":"MohammadTaghi Hajiaghayi","orcid":null},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]},{"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":"MohammadTaghi Hajiaghayi","raw_affiliation_strings":["University of Maryland at College Park, College Park, USA","AT&T Labs\u2014Research, Florham Park, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland at College Park, College Park, USA","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"AT&T Labs\u2014Research, Florham Park, USA","institution_ids":["https://openalex.org/I1283103587"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087578885","display_name":"Howard Karloff","orcid":"https://orcid.org/0000-0003-4490-2324"},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Howard Karloff","raw_affiliation_strings":["AT&T Labs\u2014Research, Florham Park, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"AT&T Labs\u2014Research, Florham Park, USA","institution_ids":["https://openalex.org/I1283103587"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5071016611"],"corresponding_institution_ids":["https://openalex.org/I20089843"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":4.1549,"has_fulltext":false,"cited_by_count":46,"citation_normalized_percentile":{"value":0.94664176,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"61","issue":"1","first_page":"190","last_page":"206"},"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.9997000098228455,"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.9997000098228455,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.996999979019165,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.8242408633232117},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.7893939018249512},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6585344076156616},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6397153735160828},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5747985243797302},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5521577000617981},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.47914236783981323},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4729718267917633},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4252665042877197},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39250898361206055},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3525312840938568},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.22473350167274475},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.16296416521072388}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.8242408633232117},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.7893939018249512},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6585344076156616},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6397153735160828},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5747985243797302},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5521577000617981},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.47914236783981323},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4729718267917633},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4252665042877197},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39250898361206055},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3525312840938568},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.22473350167274475},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.16296416521072388},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s00453-010-9464-3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-010-9464-3","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.158.8863","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.158.8863","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-math.mit.edu/~hajiagha/LabelCover.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.204.7210","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.204.7210","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.research.att.com/export/sites/att_labs/techdocs/TD_7R6RSQ.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W80618698","https://openalex.org/W1502199009","https://openalex.org/W1517517986","https://openalex.org/W1520529901","https://openalex.org/W1562956125","https://openalex.org/W1599622173","https://openalex.org/W1981873012","https://openalex.org/W1990313671","https://openalex.org/W1997369416","https://openalex.org/W1998721609","https://openalex.org/W2012722516","https://openalex.org/W2018511415","https://openalex.org/W2022092881","https://openalex.org/W2030365814","https://openalex.org/W2036836182","https://openalex.org/W2052687843","https://openalex.org/W2058486861","https://openalex.org/W2091602684","https://openalex.org/W2102984710","https://openalex.org/W2121615984","https://openalex.org/W2123400463","https://openalex.org/W2132302072","https://openalex.org/W2133219745","https://openalex.org/W2162071758","https://openalex.org/W2295381714","https://openalex.org/W2484051058","https://openalex.org/W2611804663","https://openalex.org/W2612119471","https://openalex.org/W2899292663","https://openalex.org/W2950087390","https://openalex.org/W3144422206","https://openalex.org/W4389615578","https://openalex.org/W4389615669"],"related_works":["https://openalex.org/W2900864464","https://openalex.org/W2475480881","https://openalex.org/W2001283893","https://openalex.org/W2121723556","https://openalex.org/W2288977275","https://openalex.org/W54727051","https://openalex.org/W2783639087","https://openalex.org/W2155956102","https://openalex.org/W2158144798","https://openalex.org/W2390244926"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":4},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":7}],"updated_date":"2026-07-25T09:21:30.201066","created_date":"2025-10-10T00:00:00"}