{"id":"https://openalex.org/W2572017251","doi":"https://doi.org/10.1007/s11590-017-1108-y","title":"Calculating approximation guarantees for partial set cover of pairs","display_name":"Calculating approximation guarantees for partial set cover of pairs","publication_year":2017,"publication_date":"2017-01-12","ids":{"openalex":"https://openalex.org/W2572017251","doi":"https://doi.org/10.1007/s11590-017-1108-y","mag":"2572017251"},"language":"en","primary_location":{"id":"doi:10.1007/s11590-017-1108-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11590-017-1108-y","pdf_url":"https://link.springer.com/content/pdf/10.1007/s11590-017-1108-y.pdf","source":{"id":"https://openalex.org/S12647387","display_name":"Optimization Letters","issn_l":"1862-4472","issn":["1862-4472","1862-4480"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Letters","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s11590-017-1108-y.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5056718928","display_name":"Peter Damaschke","orcid":"https://orcid.org/0000-0003-4047-7594"},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Peter Damaschke","raw_affiliation_strings":["Department of Computer Science and Engineering, Chalmers University, 41296, G\u00f6teborg, Sweden","Department of Computer Science and Engineering, Chalmers University, G\u00f6teborg, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Chalmers University, 41296, G\u00f6teborg, Sweden","institution_ids":["https://openalex.org/I66862912"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, Chalmers University, G\u00f6teborg, Sweden","institution_ids":["https://openalex.org/I66862912"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5056718928"],"corresponding_institution_ids":["https://openalex.org/I66862912"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":1.4467,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.82739178,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"11","issue":"7","first_page":"1293","last_page":"1302"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9995999932289124,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9973999857902527,"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.9940000176429749,"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/cover","display_name":"Cover (algebra)","score":0.8102964758872986},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.8093352317810059},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6536184549331665},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6533507108688354},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6102019548416138},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.607960045337677},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6041145324707031},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5985427498817444},{"id":"https://openalex.org/keywords/covering-problems","display_name":"Covering problems","score":0.598222553730011},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5027036666870117},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.47902101278305054},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45159009099006653},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41243216395378113},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2743300795555115},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.25676408410072327}],"concepts":[{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.8102964758872986},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.8093352317810059},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6536184549331665},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6533507108688354},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6102019548416138},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.607960045337677},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6041145324707031},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5985427498817444},{"id":"https://openalex.org/C103646786","wikidata":"https://www.wikidata.org/wiki/Q5179260","display_name":"Covering problems","level":3,"score":0.598222553730011},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5027036666870117},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.47902101278305054},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45159009099006653},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41243216395378113},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2743300795555115},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.25676408410072327},{"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":3,"locations":[{"id":"doi:10.1007/s11590-017-1108-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11590-017-1108-y","pdf_url":"https://link.springer.com/content/pdf/10.1007/s11590-017-1108-y.pdf","source":{"id":"https://openalex.org/S12647387","display_name":"Optimization Letters","issn_l":"1862-4472","issn":["1862-4472","1862-4480"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Letters","raw_type":"journal-article"},{"id":"pmh:oai:publications.lib.chalmers.se:252342","is_oa":false,"landing_page_url":"http://publications.lib.chalmers.se/publication/252342-calculating-approximation-guarantees-for-partial-set-cover-of-pairs","pdf_url":null,"source":{"id":"https://openalex.org/S4377196470","display_name":"Chalmers Publication Library (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text.Article.Journal.PeerReviewed"},{"id":"pmh:oai:research.chalmers.se:252342","is_oa":false,"landing_page_url":"https://research.chalmers.se/en/publication/252342","pdf_url":null,"source":{"id":"https://openalex.org/S4306402469","display_name":"Chalmers Research (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":null}],"best_oa_location":{"id":"doi:10.1007/s11590-017-1108-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11590-017-1108-y","pdf_url":"https://link.springer.com/content/pdf/10.1007/s11590-017-1108-y.pdf","source":{"id":"https://openalex.org/S12647387","display_name":"Optimization Letters","issn_l":"1862-4472","issn":["1862-4472","1862-4480"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Letters","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7715921157","display_name":"Information driven s\u00e4ker Business Intelligence","funder_award_id":"IIS11-0089","funder_id":"https://openalex.org/F4320320940","funder_display_name":"Stiftelsen f\u00f6r\u00a0Strategisk Forskning"}],"funders":[{"id":"https://openalex.org/F4320320940","display_name":"Stiftelsen f\u00f6r\u00a0Strategisk Forskning","ror":"https://ror.org/044wr7g58"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2572017251.pdf","grobid_xml":"https://content.openalex.org/works/W2572017251.grobid-xml"},"referenced_works_count":10,"referenced_works":["https://openalex.org/W1153009270","https://openalex.org/W1517036688","https://openalex.org/W1525118263","https://openalex.org/W1550117727","https://openalex.org/W1974757757","https://openalex.org/W1992349235","https://openalex.org/W2040081895","https://openalex.org/W2136816474","https://openalex.org/W2143996311","https://openalex.org/W2157054705"],"related_works":["https://openalex.org/W2108073487","https://openalex.org/W2112112676","https://openalex.org/W4247100793","https://openalex.org/W2551034790","https://openalex.org/W1966805076","https://openalex.org/W2063671489","https://openalex.org/W1502438505","https://openalex.org/W1558145674","https://openalex.org/W2077783414","https://openalex.org/W1498886170"],"abstract_inverted_index":{"As":[0],"a":[1,4,32,40,46,99,109,120,136],"part":[2],"of":[3,10,24,35,37,43,54,73,112,114,126],"heuristic":[5],"for":[6,58,71,90],"the":[7,19,51,55,59,68,80,91,149],"fast":[8],"detection":[9],"new":[11],"word":[12],"combinations":[13],"in":[14,101,119],"text":[15],"streams,":[16],"we":[17,28,106,129,134,144],"consider":[18],"NP-hard":[20],"Partial":[21,61],"Set":[22,62],"Cover":[23,63],"Pairs":[25],"problem.":[26],"There":[27],"wish":[29],"to":[30,138],"cover":[31],"maximum":[33],"number":[34,42,111],"pairs":[36,74,81,125],"elements":[38,127],"by":[39],"prescribed":[41],"sets":[44],"from":[45],"given":[47],"set":[48,151],"family.":[49],"While":[50],"approximation":[52,88,141],"ratio":[53],"greedy":[56,93],"algorithm":[57],"classic":[60],"problem":[64,100],"is":[65,75],"completely":[66],"understood,":[67],"same":[69],"question":[70],"covering":[72],"intrinsically":[76],"more":[77],"complicated,":[78],"since":[79],"insert":[82],"some":[83],"graph-theoretic":[84],"structure.":[85],"The":[86],"best":[87],"guarantee":[89],"first":[92],"step":[94],"can":[95,128],"be":[96],"rephrased":[97],"as":[98],"extremal":[102],"combinatorics:":[103],"Assume":[104],"that":[105],"may":[107],"place":[108],"fixed":[110,115],"subsets":[113],"and":[116,143],"equal":[117],"size":[118],"set,":[121],"how":[122],"many":[123],"different":[124],"cover?":[130],"In":[131],"this":[132],"paper":[133],"introduce":[135],"method":[137],"calculate":[139],"optimal":[140],"guarantees,":[142],"demonstrate":[145],"its":[146],"use":[147],"on":[148],"smallest":[150],"families.":[152]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-07-02T09:51:11.867554","created_date":"2025-10-10T00:00:00"}