{"id":"https://openalex.org/W1563441842","doi":"https://doi.org/10.1090/dimacs/040/11","title":"Approximating dense cases of covering problems","display_name":"Approximating dense cases of covering problems","publication_year":1998,"publication_date":"1998-03-03","ids":{"openalex":"https://openalex.org/W1563441842","doi":"https://doi.org/10.1090/dimacs/040/11","mag":"1563441842"},"language":"en","primary_location":{"id":"doi:10.1090/dimacs/040/11","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/040/11","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"},"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/A5108090276","display_name":"Marek Karpi\u0144ski","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Marek Karpinski","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5072751459","display_name":"Alex Zelikovsky","orcid":"https://orcid.org/0000-0003-4424-4691"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Aleksandr Zelikovsky","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5108090276"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.0213,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.84606699,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"169","last_page":"178"},"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.9990000128746033,"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.9990000128746033,"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.9965999722480774,"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/T12288","display_name":"Optimization and Search Problems","score":0.9606999754905701,"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/vertex-cover","display_name":"Vertex cover","score":0.8603411912918091},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7866730690002441},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6858226656913757},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5730133056640625},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5671753883361816},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5070393085479736},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.5035943388938904},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.5000853538513184},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.48667842149734497},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.48555323481559753},{"id":"https://openalex.org/keywords/covering-problems","display_name":"Covering problems","score":0.45734477043151855},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.4554433822631836},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4133487939834595},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.36353570222854614},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.32448267936706543},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.13548722863197327}],"concepts":[{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.8603411912918091},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7866730690002441},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6858226656913757},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5730133056640625},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5671753883361816},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5070393085479736},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.5035943388938904},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.5000853538513184},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.48667842149734497},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.48555323481559753},{"id":"https://openalex.org/C103646786","wikidata":"https://www.wikidata.org/wiki/Q5179260","display_name":"Covering problems","level":3,"score":0.45734477043151855},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.4554433822631836},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4133487939834595},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.36353570222854614},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.32448267936706543},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.13548722863197327},{"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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1090/dimacs/040/11","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/040/11","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.49.5997","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.49.5997","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://dimacs.rutgers.edu/pub/dimacs/TechnicalReports/TechReports/1996/96-59.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.49.9653","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.49.9653","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://theory.cs.uni-bonn.de/~marek/publications/85160-cs.ps.Z","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.53.4697","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.4697","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.virginia.edu/~alexz/postscript/dense98.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.55.9774","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.55.9774","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.icsi.berkeley.edu/pub/techreports/1996/tr-96-059.ps.gz","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":0,"referenced_works":[],"related_works":["https://openalex.org/W2569006230","https://openalex.org/W2123734400","https://openalex.org/W2075346653","https://openalex.org/W154567010","https://openalex.org/W2978915811","https://openalex.org/W1606488336","https://openalex.org/W1539102880","https://openalex.org/W2072015757","https://openalex.org/W2613128454","https://openalex.org/W2949907752","https://openalex.org/W2899153618","https://openalex.org/W2070814595","https://openalex.org/W2079758416","https://openalex.org/W2890196309","https://openalex.org/W3001424434","https://openalex.org/W2042977557","https://openalex.org/W2738162363","https://openalex.org/W2097945626","https://openalex.org/W2901780026","https://openalex.org/W2944918303"],"abstract_inverted_index":{"We":[0,36,66,95],"study":[1,97],"dense":[2,19,40,74],"cases":[3,133],"of":[4,10,134,147,151,168],"several":[5],"covering":[6],"problems.":[7],"An":[8],"instance":[9],"the":[11,39,48,73,83,98,125,156],"set":[12,41],"cover":[13,42,100],"problem":[14,43,77,101,107],"with":[15,47,124],"m":[16],"sets":[17],"is":[18,22,61,88,108],"if":[20],"there":[21],"ffl":[23],"?":[24,57],"0":[25,58],"such":[26],"that":[27,38],"any":[28,55],"element":[29],"belongs":[30],"to":[31,63,90,110,140],"at":[32,91],"least":[33,92],"fflm":[34],"sets.":[35],"show":[37],"can":[44],"be":[45,64,111,141],"approximated":[46],"performance":[49,126],"ratio":[50,127],"c":[51,56],"log":[52],"n":[53],"for":[54,72,82],"and":[59,155],"it":[60],"unlikely":[62],"NP-hard.":[65],"construct":[67],"a":[68,120],"polynomial-time":[69],"approximation":[70,122],"scheme":[71],"Steiner":[75],"tree":[76],"in":[78,102,115,143],"n-vertex":[79],"graphs,":[80,117],"i.e.":[81],"case":[84],"when":[85],"each":[86],"terminal":[87],"adjacent":[89],"ffln":[93],"vertices.":[94],"also":[96],"vertex":[99],"ffl-dense":[103],"graphs.":[104],"Though":[105],"this":[106],"shown":[109,139],"still":[112],"MAX-SNP-hard":[113],"as":[114],"general":[116],"we":[118],"find":[119],"better":[121],"algorithm":[123],"2":[128],"1+ffl":[129],".":[130],"The":[131],"superdense":[132],"all":[135],"these":[136],"problems":[137],"are":[138],"solvable":[142],"polynomial":[144],"time.":[145],"Dept.":[146,167],"Computer":[148,158,169],"Science,":[149,170],"University":[150],"Bonn,":[152,154],"53117":[153],"International":[157],"Science":[159],"Institute,":[160],"Berkeley.":[161],"Research":[162],"partially":[163],"done":[164],"while":[165],"visiting":[166],"P...":[171]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-04-07T06:01:17.266235","created_date":"2016-06-24T00:00:00"}