Pages that link to "Set cover problem"
Jump to navigation
Jump to search
The following pages link to Set cover problem:
Displaying 34 items.
- Graph theory (← links)
- Linear programming (← links)
- Greedy algorithm (← links)
- Quine–McCluskey algorithm (← links)
- Combinatorial optimization (← links)
- Branch and bound (← links)
- Steiner tree problem (← links)
- Approximation algorithm (← links)
- Ant colony optimization algorithms (← links)
- Covering problems (← links)
- Metric dimension (graph theory) (← links)
- List of NP-complete problems (← links)
- Dominating set (← links)
- Set packing (← links)
- Shortest common supersequence (← links)
- Memetic algorithm (← links)
- PLS (complexity) (← links)
- Linear programming relaxation (← links)
- Sunflower (mathematics) (← links)
- Optimal facility location (← links)
- K-approximation of k-hitting set (← links)
- Aztec diamond (← links)
- Packing in a hypergraph (← links)
- Maximum coverage problem (← links)
- Randomized rounding (← links)
- Ε-net (computational geometry) (← links)
- Polygon covering (← links)
- Geometric set cover problem (← links)
- Bucket queue (← links)
- Multiplicative weight update method (← links)
- Matching in hypergraphs (← links)
- Vertex cover in hypergraphs (← links)
- E-graph (← links)
- Testwiki:Reference desk/Archives/Mathematics/2012 September 18 (← links)