{"id":"https://openalex.org/W2008469033","doi":"https://doi.org/10.1137/s089548019325232x","title":"Approximation Algorithms for the <i>k</i>-Clique Covering Problem","display_name":"Approximation Algorithms for the <i>k</i>-Clique Covering Problem","publication_year":1996,"publication_date":"1996-08-01","ids":{"openalex":"https://openalex.org/W2008469033","doi":"https://doi.org/10.1137/s089548019325232x","mag":"2008469033"},"language":"en","primary_location":{"id":"doi:10.1137/s089548019325232x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s089548019325232x","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.tue.nl/en/publications/fe47aa05-c52d-413b-95b5-1d5b1c753b55","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5071419027","display_name":"Oliver Goldschmidt","orcid":null},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]},{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Oliver Goldschmidt","raw_affiliation_strings":["Department of Mathematics and Computing Science, Eindhoven University of Technology, the Netherlands","Department of Industrial Engineering and Operations Research, University of California at Berkeley, Berkeley, CA 94720","Department of Management Science and Information Systems, University of Texas at Austin. Austin, TX 78712-1175","Department of Mechanical Engineering, University of Texas at Austin, Austin, TX 78712-1063"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computing Science, Eindhoven University of Technology, the Netherlands","institution_ids":[]},{"raw_affiliation_string":"Department of Industrial Engineering and Operations Research, University of California at Berkeley, Berkeley, CA 94720","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"Department of Management Science and Information Systems, University of Texas at Austin. Austin, TX 78712-1175","institution_ids":[]},{"raw_affiliation_string":"Department of Mechanical Engineering, University of Texas at Austin, Austin, TX 78712-1063","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085640376","display_name":"Dorit S. Hochbaum","orcid":"https://orcid.org/0000-0002-2498-0512"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]},{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dorit S. Hochbaum","raw_affiliation_strings":["Department of Industrial Engineering and Operations Research, University of California at Berkeley, Berkeley, CA 94720","Department of Mathematics and Computing Science, Eindhoven University of Technology, the Netherlands","Department of Management Science and Information Systems, University of Texas at Austin. Austin, TX 78712-1175","Department of Mechanical Engineering, University of Texas at Austin, Austin, TX 78712-1063"],"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering and Operations Research, University of California at Berkeley, Berkeley, CA 94720","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"Department of Mathematics and Computing Science, Eindhoven University of Technology, the Netherlands","institution_ids":[]},{"raw_affiliation_string":"Department of Management Science and Information Systems, University of Texas at Austin. Austin, TX 78712-1175","institution_ids":[]},{"raw_affiliation_string":"Department of Mechanical Engineering, University of Texas at Austin, Austin, TX 78712-1063","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063364295","display_name":"C.A.J. Hurkens","orcid":"https://orcid.org/0000-0002-5132-6751"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Cor Hurkens","raw_affiliation_strings":["Stochastics W&I"],"affiliations":[{"raw_affiliation_string":"Stochastics W&I","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018941843","display_name":"Gang Yu","orcid":"https://orcid.org/0000-0001-6413-4882"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gang Yu","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5071419027"],"corresponding_institution_ids":["https://openalex.org/I86519309","https://openalex.org/I95457486"],"apc_list":null,"apc_paid":null,"fwci":1.1031,"has_fulltext":true,"cited_by_count":17,"citation_normalized_percentile":{"value":0.80745987,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"9","issue":"3","first_page":"492","last_page":"509"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9957000017166138,"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.9957000017166138,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9853000044822693,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9818999767303467,"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/mathematics","display_name":"Mathematics","score":0.7008706331253052},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6703676581382751},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.6574258804321289},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.5699049830436707},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.5453708171844482},{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.5069568157196045},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.4899112582206726},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4859972894191742},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4761669337749481},{"id":"https://openalex.org/keywords/set-packing","display_name":"Set packing","score":0.46311914920806885},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41562414169311523},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.38307589292526245},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3289562463760376},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.19765445590019226},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.14849135279655457},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.13488134741783142}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7008706331253052},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6703676581382751},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.6574258804321289},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.5699049830436707},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.5453708171844482},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.5069568157196045},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.4899112582206726},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4859972894191742},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4761669337749481},{"id":"https://openalex.org/C134516590","wikidata":"https://www.wikidata.org/wiki/Q475603","display_name":"Set packing","level":3,"score":0.46311914920806885},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41562414169311523},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.38307589292526245},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3289562463760376},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.19765445590019226},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.14849135279655457},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.13488134741783142},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/s089548019325232x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s089548019325232x","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire/fe47aa05-c52d-413b-95b5-1d5b1c753b55","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/fe47aa05-c52d-413b-95b5-1d5b1c753b55","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Goldschmidt, O, Hochbaum, D S, Hurkens, C A J & Yu, G 1996, 'Approximation algorithms for the k-clique covering problems', SIAM Journal on Discrete Mathematics, vol. 9, no. 3, pp. 492-509. https://doi.org/10.1137/S089548019325232X","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/fe47aa05-c52d-413b-95b5-1d5b1c753b55","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/fe47aa05-c52d-413b-95b5-1d5b1c753b55","pdf_url":"https://research.tue.nl/nl/publications/fe47aa05-c52d-413b-95b5-1d5b1c753b55","source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Discrete Mathematics, 9(3), 492 - 509. Society for Industrial and Applied Mathematics (SIAM)","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:openaire/fe47aa05-c52d-413b-95b5-1d5b1c753b55","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/fe47aa05-c52d-413b-95b5-1d5b1c753b55","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Goldschmidt, O, Hochbaum, D S, Hurkens, C A J & Yu, G 1996, 'Approximation algorithms for the k-clique covering problems', SIAM Journal on Discrete Mathematics, vol. 9, no. 3, pp. 492-509. https://doi.org/10.1137/S089548019325232X","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8876996369","display_name":null,"funder_award_id":"N00014","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"}],"funders":[{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1991858502","https://openalex.org/W2006069852","https://openalex.org/W2013469283","https://openalex.org/W2018707362","https://openalex.org/W2040924621","https://openalex.org/W2059936808","https://openalex.org/W2071381070","https://openalex.org/W2072765020","https://openalex.org/W2075710887","https://openalex.org/W2076146651","https://openalex.org/W2086252904","https://openalex.org/W2088188524","https://openalex.org/W2128366796","https://openalex.org/W2143816583","https://openalex.org/W2146792198","https://openalex.org/W2157054705","https://openalex.org/W2163322487","https://openalex.org/W2167925113","https://openalex.org/W2727200828"],"related_works":["https://openalex.org/W2165678151","https://openalex.org/W1796509207","https://openalex.org/W2082603400","https://openalex.org/W3203939381","https://openalex.org/W2140498717","https://openalex.org/W858234464","https://openalex.org/W2254682470","https://openalex.org/W2287267874","https://openalex.org/W1995022503","https://openalex.org/W168093571"],"abstract_inverted_index":{"The":[0,28,79,94],"problem":[1,18,29,80,97],"of":[2,23,45,53,68,118,133,146],"covering":[3,96,122,148,165],"edges":[4,50],"and":[5,36,51],"vertices":[6,52],"in":[7,11,20],"a":[8,12,17,34,37,66,82,102],"graph":[9,35,55],"(or":[10],"hypergraph)":[13],"was":[14],"motivated":[15],"by":[16,58],"arising":[19],"the":[21,24,42,54,61,110,116,138],"context":[22],"component":[25],"assembly":[26],"problem.":[27,105],"is":[30,107],"as":[31,101,162],"follows:":[32],"given":[33],"clique":[38,73],"size":[39],"k,":[40],"find":[41],"minimum":[43],"number":[44],"k-cliques":[46],"such":[47],"that":[48,109],"all":[49],"are":[56],"covered":[57],"(included":[59],"in)":[60],"cliques.":[62],"This":[63],"paper":[64],"provides":[65],"collection":[67],"approximation":[69],"algorithms":[70,111,136],"for":[71,87,137],"various":[72],"sizes":[74],"with":[75,153],"proven":[76],"worst-case":[77,155],"bounds.":[78],"has":[81],"natural":[83],"extension":[84],"to":[85],"hypergraphs,":[86],"which":[88,114],"we":[89,112],"consider":[90],"one":[91],"particular":[92],"class.":[93],"k-clique":[95],"can":[98,150],"be":[99,151],"formulated":[100],"set":[103,121,139,147,164],"coveringg":[104],"It":[106],"shown":[108],"design,":[113],"exploit":[115],"structure":[117],"this":[119],"special":[120,144],"problem,":[123],"have":[124],"better":[125,154],"performance":[126],"than":[127,159],"those":[128],"derived":[129],"from":[130],"direct":[131],"applications":[132],"general":[134,163],"purpose":[135],"covering.":[140],"In":[141],"particular,":[142],"these":[143],"classes":[145],"problems":[149],"solved":[152],"bounds":[156],"and/or":[157],"complexity":[158],"if":[160],"treated":[161],"problems.":[166]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2016-06-24T00:00:00"}