{"id":"https://openalex.org/W1971398538","doi":"https://doi.org/10.1016/s1571-0661(04)80716-3","title":"Greedy Algorithm for Set Cover in Context of Knowledge Discovery Problems","display_name":"Greedy Algorithm for Set Cover in Context of Knowledge Discovery Problems","publication_year":2003,"publication_date":"2003-03-01","ids":{"openalex":"https://openalex.org/W1971398538","doi":"https://doi.org/10.1016/s1571-0661(04)80716-3","mag":"1971398538"},"language":"en","primary_location":{"id":"doi:10.1016/s1571-0661(04)80716-3","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)80716-3","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/s1571-0661(04)80716-3","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5009085292","display_name":"Mikhail Moshkov","orcid":"https://orcid.org/0000-0003-0085-9483"},"institutions":[{"id":"https://openalex.org/I99205534","display_name":"Yaroslav-the-Wise Novgorod State University","ror":"https://ror.org/04qzrw529","country_code":"RU","type":"education","lineage":["https://openalex.org/I99205534"]},{"id":"https://openalex.org/I47410878","display_name":"Nizhny Novgorod State Pedagogical University","ror":"https://ror.org/05mm0yv21","country_code":"RU","type":"education","lineage":["https://openalex.org/I47410878"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Mikhail Ju. Moshkov","raw_affiliation_strings":["Faculty of Computing Mathematics and Cybernetics, Nizhny Novgorod State University, 23, Gagarina Av., Nizhny Novgorod, 603950, Russia"],"affiliations":[{"raw_affiliation_string":"Faculty of Computing Mathematics and Cybernetics, Nizhny Novgorod State University, 23, Gagarina Av., Nizhny Novgorod, 603950, Russia","institution_ids":["https://openalex.org/I47410878","https://openalex.org/I99205534"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5009085292"],"corresponding_institution_ids":["https://openalex.org/I47410878","https://openalex.org/I99205534"],"apc_list":null,"apc_paid":null,"fwci":0.709,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.68591612,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"82","issue":"4","first_page":"174","last_page":"185"},"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.9994999766349792,"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.9994999766349792,"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.9983999729156494,"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/T12288","display_name":"Optimization and Search Problems","score":0.9884999990463257,"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/cardinality","display_name":"Cardinality (data modeling)","score":0.8144180178642273},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.7439136505126953},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.6457188129425049},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6278259754180908},{"id":"https://openalex.org/keywords/reduct","display_name":"Reduct","score":0.5904545187950134},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5893415808677673},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.558535099029541},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.465961754322052},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44906914234161377},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.41652220487594604},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40546277165412903},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.38657933473587036},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36796844005584717},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3001224398612976},{"id":"https://openalex.org/keywords/rough-set","display_name":"Rough set","score":0.17380568385124207},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.1397157609462738}],"concepts":[{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.8144180178642273},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.7439136505126953},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.6457188129425049},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6278259754180908},{"id":"https://openalex.org/C69177213","wikidata":"https://www.wikidata.org/wiki/Q12880812","display_name":"Reduct","level":3,"score":0.5904545187950134},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5893415808677673},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.558535099029541},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.465961754322052},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44906914234161377},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.41652220487594604},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40546277165412903},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.38657933473587036},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36796844005584717},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3001224398612976},{"id":"https://openalex.org/C111012933","wikidata":"https://www.wikidata.org/wiki/Q3137210","display_name":"Rough set","level":2,"score":0.17380568385124207},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.1397157609462738},{"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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s1571-0661(04)80716-3","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)80716-3","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/s1571-0661(04)80716-3","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)80716-3","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W610977968","https://openalex.org/W1594031697","https://openalex.org/W1969665089","https://openalex.org/W2000869424","https://openalex.org/W2011039300","https://openalex.org/W2040924621","https://openalex.org/W2163322487","https://openalex.org/W2506703326","https://openalex.org/W2582765108","https://openalex.org/W3085162807"],"related_works":["https://openalex.org/W4205401541","https://openalex.org/W2964627416","https://openalex.org/W2950850544","https://openalex.org/W1852965370","https://openalex.org/W165570169","https://openalex.org/W1550117727","https://openalex.org/W3095810947","https://openalex.org/W1567570895","https://openalex.org/W1986806918","https://openalex.org/W2202486749"],"abstract_inverted_index":{"In":[0,125],"the":[1,19,32,36,47,53,65,98,103,118,126,134,142,150,157,172],"paper":[2],"some":[3],"problems":[4,15,167],"connected":[5],"with":[6,79],"a":[7,28,84,91,114],"process":[8],"of":[9,56,67,71,97,105,121,128,136,149,152,159,164,174],"knowledge":[10,165],"discovery":[11,166],"are":[12,16],"considered.":[13],"These":[14],"reduced":[17],"to":[18,41,171],"set":[20,48],"cover":[21,49,108,123,161],"problem.":[22],"It":[23],"is":[24,39,109,147,168],"known":[25],"that":[26,102,156],"under":[27],"plausible":[29],"assumption":[30],"on":[31,64,117],"class":[33],"N":[34],"P":[35],"greedy":[37,73,77],"algorithm":[38,58,74,78,82],"close":[40,170],"best":[42],"approximate":[43,175],"polynomial":[44],"algorithms":[45],"for":[46,131],"problem":[50],"solving.":[51],"Unfortunately,":[52],"performance":[54],"ratio":[55],"this":[57],"grows":[59],"almost":[60],"as":[61],"natural":[62],"logarithm":[63],"cardinality":[66,104,120,151],"covered":[68,153],"set.":[69,99,154],"Instead":[70],"usual":[72],"we":[75,139],"consider":[76],"threshold.":[80],"This":[81,145],"constructs":[83],"partial":[85,107,160],"cover,":[86],"which":[87],"covers":[88],"at":[89],"least":[90],"fixed":[92],"part":[93],"(for":[94],"example,":[95,132],"90%)":[96],"We":[100],"prove":[101],"constructed":[106],"bounded":[110],"from":[111],"above":[112],"by":[113],"linear":[115],"function":[116,138,143],"minimal":[119],"exact":[122],"Cmin.":[124],"case":[127],"90%":[129],"-cover,":[130],"in":[133,162],"capacity":[135],"such":[137],"can":[140],"take":[141],"2.31,\u00b7,Cmin+1.":[144],"bound":[146],"independent":[148],"Notice":[155],"concept":[158,173],"context":[163],"very":[169],"reduct.":[176]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}