Pages that link to "Approximation algorithm"
Jump to navigation
Jump to search
The following pages link to Approximation algorithm:
Displaying 50 items.
- Metric dimension (graph theory) (links)
- Michael Garey (links)
- Dominating set (links)
- Domatic number (links)
- Convex polytope (links)
- Feedback arc set (links)
- Clustal (links)
- APX (links)
- No-three-in-line problem (links)
- Guillotine cutting (links)
- Rho-approximation algorithm (redirect page) (links)
- Ρ-approximation algorithm (redirect page) (links)
- Relative performance guarantee (redirect page) (links)
- Absolute performance guarantee (redirect page) (links)
- Shortest common supersequence (links)
- Éva Tardos (links)
- PCP theorem (links)
- Domination analysis (links)
- Karloff–Zwick algorithm (links)
- Maximum satisfiability problem (links)
- Christofides algorithm (links)
- Unit disk graph (links)
- Maximum common induced subgraph (links)
- Ellipsoid method (links)
- Midsphere (links)
- Grundy number (links)
- Kőnig's theorem (graph theory) (links)
- Maximum cardinality matching (links)
- Maximum weight matching (links)
- Linear programming relaxation (links)
- Per Enflo (links)
- Umesh Vazirani (links)
- Barnes–Hut simulation (links)
- Cactus graph (links)
- Multi-objective optimization (links)
- Optimal facility location (links)
- Václav Chvátal (links)
- Quasi-bipartite graph (links)
- Approximation ratio (redirect page) (links)
- Metric space (links)
- Ronald Graham (links)
- Clique problem (links)
- Spanning tree (links)
- 2-satisfiability (links)
- Independent set (graph theory) (links)
- Complete coloring (links)
- Cubic graph (links)
- K-minimum spanning tree (links)
- Fulkerson Prize (links)
- Art gallery problem (links)
- Betweenness problem (links)
- Feedback arc set (links)
- Cut (graph theory) (links)
- No-three-in-line problem (links)
- Connected dominating set (links)
- Diameter (graph theory) (links)
- Domination analysis (links)
- Maximum satisfiability problem (links)
- Smallest grammar problem (links)
- Semidefinite programming (links)
- Pathwidth (links)
- Grundy number (links)
- Linear programming relaxation (links)
- Closest pair of points problem (links)
- Cactus graph (links)
- Quasi-bipartite graph (links)
- Claw-free graph (links)
- Hosoya index (links)
- Algorithmic mechanism design (links)
- Algorithmic game theory (links)
- Clique cover (links)
- Smoothed analysis (links)
- Planar separator theorem (links)
- Maximum cut (links)
- SNP (complexity) (links)
- LEMON (C++ library) (links)
- Naum Z. Shor (links)
- K-approximation of k-hitting set (links)
- Shmuel Safra (links)
- R-approximation algorithm (redirect page) (links)
- Clique-width (links)
- Centerpoint (geometry) (links)
- Clique cover (links)
- Price of anarchy (links)
- Clique-sum (links)