{"id":"https://openalex.org/W2008469033","doi":"https://doi.org/10.1137/s089548019325232x","title":"Approximation Algorithms for the k-Clique Covering Problem","display_name":"Approximation Algorithms for the k-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":{"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":["1095-7146","0895-4801"],"is_oa":false,"is_in_doaj":false,"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,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://pure.tue.nl/ws/files/1322627/Metis132674.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5071419027","display_name":"Oliver Goldschmidt","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Oliver Goldschmidt","raw_affiliation_string":"","raw_affiliation_strings":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085640376","display_name":"Dorit S. Hochbaum","orcid":"https://orcid.org/0000-0002-2498-0512"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dorit S. Hochbaum","raw_affiliation_string":"","raw_affiliation_strings":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063364295","display_name":"Caj Cor Hurkens","orcid":"https://orcid.org/0000-0002-5132-6751"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Cor Hurkens","raw_affiliation_string":"Stochastics W&I","raw_affiliation_strings":["Stochastics W&I"]},{"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_string":"","raw_affiliation_strings":[]}],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":15,"cited_by_percentile_year":{"min":84,"max":85},"biblio":{"volume":"9","issue":"3","first_page":"492","last_page":"509"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Distributed Coordination in Online Robotics Research","score":0.9957,"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":"Distributed Coordination in Online Robotics Research","score":0.9957,"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 of Cutting and Packing Problems","score":0.9853,"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":"Active Learning in Machine Learning Research","score":0.9819,"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":[{"keyword":"algorithms","score":0.3923},{"keyword":"approximation","score":0.3817}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.70087063},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.67036766},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.6574259},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.569905},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.5453708},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.5069568},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.48991126},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4859973},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.47616693},{"id":"https://openalex.org/C134516590","wikidata":"https://www.wikidata.org/wiki/Q475603","display_name":"Set packing","level":3,"score":0.46311915},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41562414},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3830759},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32895625},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.19765446},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.14849135},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.13488135},{"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":[{"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":["1095-7146","0895-4801"],"is_oa":false,"is_in_doaj":false,"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,"version":null,"is_accepted":false,"is_published":false},{"is_oa":true,"landing_page_url":"https://pure.tue.nl/ws/files/1322627/Metis132674.pdf","pdf_url":"https://pure.tue.nl/ws/files/1322627/Metis132674.pdf","source":null,"license":null,"version":"submittedVersion","is_accepted":false,"is_published":false},{"is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/fe47aa05-c52d-413b-95b5-1d5b1c753b55","pdf_url":"https://research.tue.nl/files/1322627/Metis132674.pdf","source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":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":["Royal Netherlands Academy of Arts and Sciences"],"type":"repository"},"license":null,"version":"submittedVersion","is_accepted":false,"is_published":false}],"best_oa_location":{"is_oa":true,"landing_page_url":"https://pure.tue.nl/ws/files/1322627/Metis132674.pdf","pdf_url":"https://pure.tue.nl/ws/files/1322627/Metis132674.pdf","source":null,"license":null,"version":"submittedVersion","is_accepted":false,"is_published":false},"sustainable_development_goals":[],"grants":[],"referenced_works_count":16,"referenced_works":["https://openalex.org/W1991858502","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/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"],"related_works":["https://openalex.org/W2254682470","https://openalex.org/W2287267874","https://openalex.org/W1995022503","https://openalex.org/W168093571","https://openalex.org/W2165678151","https://openalex.org/W1796509207","https://openalex.org/W2082603400","https://openalex.org/W3203939381","https://openalex.org/W2140498717","https://openalex.org/W858234464"],"ngrams_url":"https://api.openalex.org/works/W2008469033/ngrams","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]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2008469033","counts_by_year":[{"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":"2024-03-05T23:18:27.277467","created_date":"2016-06-24"}