Pages that link to "Polynomial-time approximation scheme"
Showing 50 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)
- Graph coloring (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)
- Dominating set (links | edit)
- Feedback arc set (links | edit)
- APX (links | edit)
- Polynomial time approximation scheme (redirect page) (links | edit)
- List of algorithm general topics (links | edit)
- Cubic graph (links | edit)
- Euclidean minimum spanning tree (links | edit)
- K-minimum spanning tree (links | edit)
- Connected dominating set (links | edit)
- PTAS reduction (links | edit)
- Planar separator theorem (links | edit)
- Convex volume approximation (links | edit)
- Minimum k-cut (links | edit)
- Dense subgraph (links | edit)
- Talk:Cobham's thesis (links | edit)
- Talk:Travelling salesman problem/Archive 1 (links | edit)
- User:Andris (links | edit)
- Efficient polynomial-time approximation scheme (redirect page) (links | edit)
- EPTAS (redirect page) (links | edit)
- Fully polynomial-time approximation scheme (links | edit)
- Efficient polynomial time approximation scheme (redirect page) (links | edit)
- Polynomial approximation scheme (redirect page) (links | edit)
- Partition problem (links | edit)
- Uniform-machines scheduling (links | edit)
- Maximum satisfiability problem (links | edit)
- Christofides algorithm (links | edit)
- List of knapsack problems (links | edit)
- Kemeny–Young method (links | edit)
- Islanding (links | edit)
- Gadget (computer science) (links | edit)
- Epsilon-equilibrium (links | edit)
- Hosoya index (links | edit)
- Conductance (graph theory) (links | edit)
- FPRAS (redirect page) (links | edit)
- EPRAS (redirect page) (links | edit)
- Polynomial-time randomized approximation scheme (redirect page) (links | edit)
- Fully polynomial-time randomized approximation scheme (redirect page) (links | edit)
- Efficient polynomial-time randomized approximation scheme (redirect page) (links | edit)
- Job-shop scheduling (links | edit)
- Clique cover (links | edit)
- Kinodynamic planning (links | edit)
- Closest string (links | edit)
- Correlation clustering (links | edit)
- David Shmoys (links | edit)