Pages that link to "Polynomial-time approximation scheme"
The following pages link to Polynomial-time approximation scheme:
Displayed 18 items.
- Boolean satisfiability problem (← links | edit)
- Knapsack problem (← links | edit)
- ♯P-complete (← links | edit)
- Travelling salesman problem (← links | edit)
- NP-hardness (← links | edit)
- Clique problem (← links | edit)
- Bin packing problem (← links | edit)
- Combinatorial optimization (← links | edit)
- 2-satisfiability (← links | edit)
- Steiner tree problem (← links | edit)
- Independent set (graph theory) (← links | edit)
- Approximation algorithm (← links | edit)
- Gödel Prize (← links | edit)
- List of complexity classes (← links | edit)
- List of terms relating to algorithms and data structures (← links | edit)
- List of University of California, Berkeley alumni (← links | edit)
- PTAS (← links | edit)
- Art gallery problem (← links | edit)