Pages that link to "Polynomial-time approximation scheme"

The following pages link to Polynomial-time approximation scheme:

Showing 50 items.

• Feedback arc set ‎ (links)
• Maximum disjoint set ‎ (links)
• Boolean satisfiability problem ‎ (links)
• Quasi-polynomial time ‎ (links)
• Halin's grid theorem ‎ (links)
• Islanding ‎ (links)
• Knapsack problem ‎ (links)
• Order polytope ‎ (links)
• ♯P-complete ‎ (links)
• Travelling salesman problem ‎ (links)
• Boson sampling ‎ (links)
• Fully proportional representation ‎ (links)
• Maximin share ‎ (links)
• Sharp-SAT ‎ (links)
• APX ‎ (links)
• Multiway number partitioning ‎ (links)
• Bin covering problem ‎ (links)
• Polynomial time approximation scheme (redirect page) ‎ (links)
  • Minimum k-cut ‎ (links)
  • Dense subgraph ‎ (links)
  • Planar separator theorem ‎ (links)
  • Convex volume approximation ‎ (links)
  • PTAS reduction ‎ (links)
  • Connected dominating set ‎ (links)
  • Cubic graph ‎ (links)
• Efficient polynomial-time approximation scheme (redirect page) ‎ (links)
  • Parameterized approximation algorithm ‎ (links)
• EPTAS (redirect page) ‎ (links)
  • Knapsack problem ‎ (links)
• Fully polynomial-time approximation scheme ‎ (links)
• Efficient polynomial time approximation scheme (redirect page) ‎ (links)
• Wiener connector ‎ (links)
• Matroid parity problem ‎ (links)
• NP-hardness ‎ (links)
• Succinct game ‎ (links)
• Parameterized approximation algorithm ‎ (links)
• Penny graph ‎ (links)
• Guillotine partition ‎ (links)
• FPRAS (redirect page) ‎ (links)
• EPRAS (redirect page) ‎ (links)
• Polynomial-time randomized approximation scheme (redirect page) ‎ (links)
  • PRAS ‎ (links)
• Fully polynomial-time randomized approximation scheme (redirect page) ‎ (links)
  • Linear extension ‎ (links)
  • Strong orientation ‎ (links)
  • Computing the permanent ‎ (links)
• Efficient polynomial-time randomized approximation scheme (redirect page) ‎ (links)
• List of knapsack problems ‎ (links)
• Highway dimension ‎ (links)
• Cutwidth ‎ (links)
• Baker's technique ‎ (links)
• Gadget (computer science) ‎ (links)
• Kemeny–Young method ‎ (links)
• Kinodynamic planning ‎ (links)
• Digraph realization problem ‎ (links)
• Bipartite realization problem ‎ (links)
• Reaction progress kinetic analysis ‎ (links)
• Graph realization problem ‎ (links)
• Job-shop scheduling ‎ (links)
• Fractional job scheduling ‎ (links)
• Matroid oracle ‎ (links)
• Closest string ‎ (links)
• Map graph ‎ (links)