Pages that link to "Set cover problem"
Jump to navigation
Jump to search
The following pages link to Set cover problem:
Displaying 36 items.
- Graph theory (links)
- Linear programming (links)
- Greedy algorithm (links)
- Quine–McCluskey algorithm (links)
- List of computability and complexity topics (links)
- Combinatorial optimization (links)
- Branch and bound (links)
- Sequence assembly (links)
- Steiner tree problem (links)
- Approximation algorithm (links)
- SCP (links)
- Ant colony optimization algorithms (links)
- Automatic summarization (links)
- List of terms relating to algorithms and data structures (links)
- Set covering (redirect page) (links)
- Covering problems (links)
- Metric dimension (graph theory) (links)
- List of NP-complete problems (links)
- Dominating set (links)
- Set covering problem (redirect page) (links)
- Karp's 21 NP-complete problems (links)
- Set cover (redirect page) (links)
- Set packing (links)
- Shortest common supersequence (links)
- Set-covering problem (redirect page) (links)
- Memetic algorithm (links)
- PLS (complexity) (links)
- Linear programming relaxation (links)
- Peptide computing (links)
- Sunflower (mathematics) (links)
- Optimal facility location (links)
- Václav Chvátal (links)
- K-approximation of k-hitting set (links)
- Shmuel Safra (links)
- Talk:Quine–McCluskey algorithm (links)
- Wiki143:WikiProject Mathematics/List of mathematics articles (S) (links)