{"id":"https://openalex.org/W2974657752","doi":"https://doi.org/10.15439/2019f2","title":"A Minimum Set-Cover Problem with several constraints","display_name":"A Minimum Set-Cover Problem with several constraints","publication_year":2019,"publication_date":"2019-09-20","ids":{"openalex":"https://openalex.org/W2974657752","doi":"https://doi.org/10.15439/2019f2","mag":"2974657752"},"language":"en","primary_location":{"id":"doi:10.15439/2019f2","is_oa":true,"landing_page_url":"https://doi.org/10.15439/2019f2","pdf_url":"https://annals-csis.org/proceedings/2019/drp/pdf/2.pdf","source":{"id":"https://openalex.org/S4220651875","display_name":"Annals of Computer Science and Information Systems","issn_l":"2300-5963","issn":["2300-5963"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":"https://openalex.org/P4310317484","host_organization_name":"Polskie Towarzystwo Informatyczne","host_organization_lineage":["https://openalex.org/P4310317484"],"host_organization_lineage_names":["Polskie Towarzystwo Informatyczne"],"type":"conference"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Computer Science and Information Systems","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://annals-csis.org/proceedings/2019/drp/pdf/2.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5047464344","display_name":"Jens D\u00f6rpinghaus","orcid":"https://orcid.org/0000-0003-0245-7752"},"institutions":[{"id":"https://openalex.org/I4210098248","display_name":"Fraunhofer Institute for Algorithms and Scientific Computing","ror":"https://ror.org/00trw9c49","country_code":"DE","type":"facility","lineage":["https://openalex.org/I4210098248","https://openalex.org/I4923324"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Jens D\u00f6rpinghaus","raw_affiliation_strings":["Fraunhofer Institute for Algorithms and Scientific Computing, Schloss Birlinghoven, Sankt Augustin, Germany"],"affiliations":[{"raw_affiliation_string":"Fraunhofer Institute for Algorithms and Scientific Computing, Schloss Birlinghoven, Sankt Augustin, Germany","institution_ids":["https://openalex.org/I4210098248"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046454905","display_name":"Carsten D\u00fcing","orcid":null},"institutions":[{"id":"https://openalex.org/I4210098248","display_name":"Fraunhofer Institute for Algorithms and Scientific Computing","ror":"https://ror.org/00trw9c49","country_code":"DE","type":"facility","lineage":["https://openalex.org/I4210098248","https://openalex.org/I4923324"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Carsten D\u00fcing","raw_affiliation_strings":["Fraunhofer Institute for Algorithms and Scientific Computing, Schloss Birlinghoven, Sankt Augustin, Germany"],"affiliations":[{"raw_affiliation_string":"Fraunhofer Institute for Algorithms and Scientific Computing, Schloss Birlinghoven, Sankt Augustin, Germany","institution_ids":["https://openalex.org/I4210098248"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008441487","display_name":"Vera Weil","orcid":null},"institutions":[{"id":"https://openalex.org/I180923762","display_name":"University of Cologne","ror":"https://ror.org/00rcxh774","country_code":"DE","type":"education","lineage":["https://openalex.org/I180923762"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Vera Weil","raw_affiliation_strings":["Department for Computer Science, University of Cologne, Germany"],"affiliations":[{"raw_affiliation_string":"Department for Computer Science, University of Cologne, Germany","institution_ids":["https://openalex.org/I180923762"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5047464344"],"corresponding_institution_ids":["https://openalex.org/I4210098248"],"apc_list":null,"apc_paid":null,"fwci":0.7091,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.67610063,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"18","issue":null,"first_page":"115","last_page":"122"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9995999932289124,"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.9995999932289124,"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/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/T10374","display_name":"Advanced Graph Theory Research","score":0.9993000030517578,"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/bipartite-graph","display_name":"Bipartite graph","score":0.7540634870529175},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.6485819816589355},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5524541139602661},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5220341682434082},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5129439234733582},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.511013388633728},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.4949604868888855},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.47524309158325195},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.46795380115509033},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4585139751434326},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4412379860877991},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43538007140159607},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4311610162258148},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.4108661413192749},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1865842342376709}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7540634870529175},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.6485819816589355},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5524541139602661},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5220341682434082},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5129439234733582},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.511013388633728},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.4949604868888855},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.47524309158325195},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.46795380115509033},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4585139751434326},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4412379860877991},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43538007140159607},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4311610162258148},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.4108661413192749},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1865842342376709},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"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/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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.15439/2019f2","is_oa":true,"landing_page_url":"https://doi.org/10.15439/2019f2","pdf_url":"https://annals-csis.org/proceedings/2019/drp/pdf/2.pdf","source":{"id":"https://openalex.org/S4220651875","display_name":"Annals of Computer Science and Information Systems","issn_l":"2300-5963","issn":["2300-5963"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":"https://openalex.org/P4310317484","host_organization_name":"Polskie Towarzystwo Informatyczne","host_organization_lineage":["https://openalex.org/P4310317484"],"host_organization_lineage_names":["Polskie Towarzystwo Informatyczne"],"type":"conference"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Computer Science and Information Systems","raw_type":"proceedings-article"},{"id":"pmh:oai:doaj.org/article:a42dbaa77c8a4c8187e410719a79ec09","is_oa":true,"landing_page_url":"https://doaj.org/article/a42dbaa77c8a4c8187e410719a79ec09","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Annals of computer science and information systems, Vol 18, Pp 115-122 (2019)","raw_type":"article"},{"id":"pmh:oai:fraunhofer.de:N-565754","is_oa":false,"landing_page_url":"http://publica.fraunhofer.de/documents/N-565754.html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400801","display_name":"Publikationsdatenbank der Fraunhofer-Gesellschaft (Fraunhofer-Gesellschaft)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4923324","host_organization_name":"Fraunhofer-Gesellschaft","host_organization_lineage":["https://openalex.org/I4923324"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Fraunhofer SCAI","raw_type":"Conference Paper"},{"id":"pmh:oai:publica.fraunhofer.de:publica/405715","is_oa":false,"landing_page_url":"https://publica.fraunhofer.de/handle/publica/405715","pdf_url":null,"source":{"id":"https://openalex.org/S4306400318","display_name":"Fraunhofer-Publica (Fraunhofer-Gesellschaft)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4923324","host_organization_name":"Fraunhofer-Gesellschaft","host_organization_lineage":["https://openalex.org/I4923324"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"conference paper"}],"best_oa_location":{"id":"doi:10.15439/2019f2","is_oa":true,"landing_page_url":"https://doi.org/10.15439/2019f2","pdf_url":"https://annals-csis.org/proceedings/2019/drp/pdf/2.pdf","source":{"id":"https://openalex.org/S4220651875","display_name":"Annals of Computer Science and Information Systems","issn_l":"2300-5963","issn":["2300-5963"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":"https://openalex.org/P4310317484","host_organization_name":"Polskie Towarzystwo Informatyczne","host_organization_lineage":["https://openalex.org/P4310317484"],"host_organization_lineage_names":["Polskie Towarzystwo Informatyczne"],"type":"conference"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Computer Science and Information Systems","raw_type":"proceedings-article"},"sustainable_development_goals":[{"display_name":"Quality Education","score":0.7599999904632568,"id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2974657752.pdf","grobid_xml":"https://content.openalex.org/works/W2974657752.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W1984394682","https://openalex.org/W1988133548","https://openalex.org/W2061172803","https://openalex.org/W2072970829","https://openalex.org/W2115024484","https://openalex.org/W2135181562","https://openalex.org/W2171471009","https://openalex.org/W2611804663","https://openalex.org/W2775872852","https://openalex.org/W2778998756","https://openalex.org/W2894360925","https://openalex.org/W2998757566","https://openalex.org/W4230784961","https://openalex.org/W4243601081","https://openalex.org/W4292027170","https://openalex.org/W4300550233","https://openalex.org/W6605928593","https://openalex.org/W6646607594","https://openalex.org/W6668482076"],"related_works":["https://openalex.org/W9203110","https://openalex.org/W2379188955","https://openalex.org/W2757966824","https://openalex.org/W2112112676","https://openalex.org/W2108073487","https://openalex.org/W4247100793","https://openalex.org/W2044818254","https://openalex.org/W2326642484","https://openalex.org/W1966805076","https://openalex.org/W2047424666"],"abstract_inverted_index":{"A":[0],"lot":[1],"of":[2,56,69,77],"problems":[3],"in":[4],"natural":[5],"language":[6],"processing":[7],"can":[8,36],"be":[9,37],"interpreted":[10],"using":[11,29,82,92,100,108],"structures":[12],"from":[13],"discrete":[14],"mathematics.":[15],"In":[16],"this":[17,70],"paper":[18],"we":[19],"will":[20],"discuss":[21],"the":[22,59,79,89,93],"search":[23],"query":[24],"and":[25,84,103],"topic":[26],"finding":[27],"problem":[28,35,71,81,91],"a":[30,40,53,63,74,98,105],"generic":[31],"context-based":[32],"approach.":[33],"This":[34],"described":[38],"as":[39,86,88,113,115],"Minimum":[41],"Set":[42],"Cover":[43],"Problem":[44],"with":[45,58],"several":[46],"constraints.":[47],"The":[48,67],"goal":[49],"is":[50,73],"to":[51],"find":[52],"minimum":[54],"covering":[55],"documents":[57],"given":[60],"context":[61],"for":[62],"fixed":[64],"weight":[65],"function.":[66],"aim":[68],"reformulation":[72,107],"deeper":[75],"understanding":[76],"both":[78],"hierarchical":[80],"union":[83],"cut":[85],"well":[87,114],"nonhierarchical":[90],"union.":[94],"We":[95],"thus":[96],"choose":[97],"modeling":[99],"bipartite":[101],"graphs":[102],"suggest":[104],"novel":[106,116],"an":[109],"integer":[110],"linear":[111],"program":[112],"graph-theoretic":[117],"approaches.":[118]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}