{"id":"https://openalex.org/keywords/set-cover","display_name":"set cover","description":"Set cover is a combinatorial optimization problem of selecting the fewest sets whose union contains every element in a given collection.","display_name_alternatives":["minimum set cover","minimum set cover problem"],"ids":{"openalex":"https://openalex.org/keywords/set-cover","wikidata":"https://www.wikidata.org/wiki/Q1192100"},"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.3964,"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.3964,"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.1121,"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"}}],"works_count":1073,"cited_by_count":27915,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/set-cover","updated_date":"2026-11-16T04:05:30","created_date":"2026-09-30T00:00:00"}
