Pages that link to "Polynomial-time approximation scheme"

The following pages link to Polynomial-time approximation scheme:

Displaying 37 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)
• Dominating set (← links)
• Feedback arc set (← links)
• APX (← links)
• Polynomial time approximation scheme (redirect page) (← links)
  • List of algorithm general topics (← links)
  • Cubic graph (← links)
  • Euclidean minimum spanning tree (← links)
  • K-minimum spanning tree (← links)
  • Connected dominating set (← links)
  • User:Andris (← links)
• Efficient polynomial-time approximation scheme (redirect page) (← links)
  • Parameterized complexity (← links)
• EPTAS (redirect page) (← links)
  • Knapsack problem (← links)
• Fully polynomial-time approximation scheme (← links)
• Efficient polynomial time approximation scheme (redirect page) (← links)
• Polynomial approximation scheme (redirect page) (← links)
• Partition problem (← links)
• Uniform-machines scheduling (← links)
• Maximum satisfiability problem (← links)
• Christofides algorithm (← links)
• List of knapsack problems (← links)
• Kemeny–Young method (← links)
• Talk:Clique problem (← links)
• Talk:Kolmogorov complexity (← links)
• Talk:Root-finding algorithm (← links)
• Wiki143:WikiProject Mathematics/List of mathematics articles (P) (← links)