The following pages link to Approximation algorithm:
Showing 50 items.
- Planar separator theorem (links)
- Parallel metaheuristic (links)
- Extremal optimization (links)
- Approximation ratio (redirect page) (links)
- Feedback arc set (links)
- Minimum-weight triangulation (links)
- Circular layout (links)
- Carsten Lund (links)
- Rotation distance (links)
- Block graph (links)
- Rank-width (links)
- Frankl–Rödl graph (links)
- Planar separator theorem (links)
- GNRS conjecture (links)
- Claw-free graph (links)
- Cut (graph theory) (links)
- Smallest grammar problem (links)
- Semidefinite programming (links)
- Algorithmic mechanism design (links)
- Ruzsa–Szemerédi problem (links)
- Grid bracing (links)
- Strong connectivity augmentation (links)
- Induced matching (links)
- No-three-in-line problem (links)
- Cutwidth (links)
- Pathwidth (links)
- Slope number (links)
- Grundy number (links)
- Bramble (graph theory) (links)
- Maximum cut (links)
- Thickness (graph theory) (links)
- Planarization (links)
- Small set expansion hypothesis (links)
- Algorithmic game theory (links)
- Connected dominating set (links)
- Carving width (links)
- Closest pair of points problem (links)
- Ronald Graham (links)
- Clique problem (links)
- Farthest-first traversal (links)
- Polygonalization (links)
- Dasgupta's objective (links)
- Hardness of approximation (links)
- Clique cover (links)
- Satish B. Rao (links)
- Cubic graph (links)
- Guided local search (links)
- MAXEkSAT (links)
- Brenda Baker (links)
- Optimal kidney exchange (links)
- Parameterized approximation algorithm (links)
- Claire Mathieu (links)
- Karmarkar–Karp bin packing algorithms (links)
- Chirp spectrum (links)
- Greedy algorithm (links)
- Liu Gang (links)
- Semidefinite programming (links)
- Shmuel Safra (links)
- Special ordered set (links)
- Strong connectivity augmentation (links)
- Highway dimension (links)
- System on a chip (links)
- Sum coloring (links)
- No-three-in-line problem (links)
- Vera Traub (links)
- Sauer–Shelah lemma (links)
- Dynamic programming (links)
- Shuchi Chawla (links)
- Quantum annealing (links)
- Guillotine cutting (links)
- Grundy number (links)
- Cuckoo search (links)
- Assignment problem (links)
- Maximum cut (links)
- Julia Chuzhoy (links)
- R-approximation algorithm (redirect page) (links)
- Line drawing algorithm (links)
- David P. Williamson (links)
- Dorit S. Hochbaum (links)
- Meta-optimization (links)
- Bipartite dimension (links)
- Small set expansion hypothesis (links)
- Tree decomposition (links)
- Interactive proof system (links)
- Mirror descent (links)
- Nicos Christofides (links)
- NP-completeness (links)
- Rho-approximation algorithm (redirect page) (links)
- Ρ-approximation algorithm (redirect page) (links)
- Relative performance guarantee (redirect page) (links)
- Absolute performance guarantee (redirect page) (links)
- Tami Tamir (links)