Algorithmresearch
Epstein-Levin EPTAS for bin packing
Also called Epstein-Levin scheme.
Efficient approximation scheme for bin packing with additive error bounded by a function of ε alone.
Efficient approximation scheme for bin packing with additive error bounded by a function of ε alone.
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 XKC6Z1 Edit this page History Report an error