Theoremadvanced
Set cover inapproximability
Also called Feige's set cover hardness.
Set cover cannot be approximated within (1-ε) ln n unless P = NP, matching the greedy algorithm.
Set cover cannot be approximated within (1-ε) ln n unless P = NP, matching the greedy algorithm.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag H4FSRY Edit this page History Report an error