{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"set covering problem","description":"A combinatorial optimization problem that seeks the smallest-cost collection of sets whose union contains every element in a given universe.","display_name_alternatives":["set cover problem","set covering"],"ids":{"openalex":"https://openalex.org/keywords/set-cover-problem","wikidata":"https://www.wikidata.org/wiki/Q1192100"},"primary_topic":null,"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.1397,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.1156,"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"}},{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.0954,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"works_count":3171,"cited_by_count":61077,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/set-cover-problem","updated_date":"2026-11-16T04:05:30","created_date":"2022-04-12T19:38:12"}
