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