Pages that link to "Polynomial-time approximation scheme"
From HandWiki
The following pages link to Polynomial-time approximation scheme:
Displayed 50 items.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)- Art gallery problem (← links)
- Bidimensionality (← links)
- Combinatorial optimization (← links)
- Correlation clustering (← links)
- Knapsack problem (← links)
- Polylogarithmic function (← links)
- Sharp-SAT (← links)
- Wiener connector (← links)
- Approximation algorithm (← links)
- Exact algorithm (← links)
- Graph coloring (← links)
- Hosoya index (← links)
- List of complexity classes (← links)
- Steiner tree problem (← links)
- Boson sampling (← links)
- Approximation-preserving reduction (← links)
- APX (← links)
- Baker's technique (← links)
- Christofides algorithm (← links)
- Feedback arc set (← links)
- Kinodynamic planning (← links)
- Minimum routing cost spanning tree (← links)
- Polygon partition (← links)
- Tardos function (← links)
- Intersection number (graph theory) (← links)
- Boolean satisfiability problem (← links)
- Digraph realization problem (← links)
- Dominating set (← links)
- List of knapsack problems (← links)
- Bipartite realization problem (← links)
- Matroid parity problem (← links)
- Barrier resilience (← links)
- Graph realization problem (← links)
- Clique cover (← links)
- Maximum satisfiability problem (← links)
- Job shop scheduling (← links)
- Travelling salesman problem (← links)
- Maximum disjoint set (← links)
- Independent set (graph theory) (← links)
- Clique problem (← links)
- Order polytope (← links)
- Map graph (← links)
- Apex graph (← links)
- Bounded expansion (← links)
- Bin packing problem (← links)
- Penny graph (← links)
- Matroid oracle (← links)
- NP-hardness (← links)
- Berlekamp switching game (← links)
- Gadget (computer science) (← links)