Everything about Set cover problem

🧭 Start here: a 6-step reading path

1. Read the overview: Set cover problemA 5-minute orientation
2. Skim a recent paper: Fixed set search applied to the multi-objective minimum weighted vertex cover problemInfluential work since 2022
3. Pick up a classic book: Organized CollapseThe most-reprinted book on the subject
4. Read the landmark paper: The Online Set Cover ProblemCited 81 times
5. Go sideways: Token reconfigurationA closely related topic
6. Go sideways: Geometric set cover problemA closely related topic

🏆 Landmark papers (most cited)

• The Online Set Cover Problem

  Noga Alon, Baruch Awerbuch, Yossi Azar · 2009 · SIAM Journal on Computing · 81 citations

• A Better-Than-Greedy Approximation Algorithm for the Minimum Set Cover Problem

  Refael Hassin, Asaf Levin · 2005 · SIAM Journal on Computing · 47 citations

• Solving the set cover problem and the problem of exact cover by 3-sets in the Adleman–Lipton model

  Weng-Long Chang, Minyi Guo · 2003 · Biosystems · 36 citations

• On the Positive–Negative Partial Set Cover problem

  Pauli Miettinen · 2008 · Information Processing Letters · 30 citations

• A rough set method for the minimum vertex cover problem of graphs

  Jinkun Chen, Yaojin Lin, Jinjin Li · 2016 · Applied Soft Computing · 29 citations

• Algorithms for connected set cover problem and fault-tolerant connected set cover problem

  Zhao Zhang, Xiaofeng Gao, Weili Wu · 2009 · Theoretical Computer Science · 27 citations

• An Algorithm for Minimal Connected Cover Set Problem in Wireless Sensor Networks

  Jie JIANG · 2006 · Journal of Software · 26 citations

• The minimum-entropy set cover problem

  Eran Halperin, Richard M. Karp · 2005 · Theoretical Computer Science · 23 citations

🆕 Influential since 2022

• Fixed set search applied to the multi-objective minimum weighted vertex cover problem

  Raka Jovanovic, Antonio P. Sanfilippo, Stefan Voß · 2022 · Journal of Heuristics · 22 citations

• Quantum Annealing with Inequality Constraints: The Set Cover Problem

  Hristo N. Djidjev · 2023 · Advanced Quantum Technologies · 21 citations

• GRASP‐ILS and set cover hybrid heuristic for the synchronized team orienteering problem with time windows

  Ala‐Eddine Yahiaoui, Aziz Moukrim, Mehdi Serairi · 2022 · International Transactions in Operational Research · 14 citations

• Set covering problem with conflict constraints

  Saeed Saffari, Yahya Fathi · 2022 · Computers & Operations Research · 13 citations

• Toward Refined Nash Equilibria for the SET K-COVER Problem via a Memorial Mixed-Response Algorithm

  Changhao Sun, Xiaochu Wang, Huaxin Qiu · 2022 · IEEE Transactions on Systems, Man, and Cybernetics: Systems · 12 citations

📚 Books worth reading

• 📕Organized CollapseDmitry N. Kozlov · 2020

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics

• Token reconfiguration In computational complexity theory and combinatorics, the token reconfiguration problem is a reconfiguration problem on a graph with both an initial and…
• Geometric set cover problem The geometric set cover problem is the special case of the set cover problem in geometric settings. The input is a range space Σ = ( X , R ) {\displaystyle…
• Vertex cover In graph theory, a vertex cover (sometimes node cover) of a graph is a set of vertices that includes at least one endpoint of every edge of the graph.…
• Dominating set In graph theory, a dominating set for a graph G is a subset D of its vertices, such that any vertex of G is in D, or has a neighbor in D. The domination…
• Set packing Set packing is a classical NP-complete problem in computational complexity theory and combinatorics, and was one of Karp's 21 NP-complete problems. Suppose…
• Matroid parity problem In combinatorial optimization, the matroid parity problem is a problem of finding the largest independent set of paired elements in a matroid, a structure…
• Metric k-center In graph theory, the metric k-center problem or vertex k-center problem is a classical combinatorial optimization problem studied in theoretical computer…
• Approximation algorithm In computer science and operations research, approximation algorithms are efficient algorithms that find approximate solutions to optimization problems…