Category:Approximation algorithms
![]() | Computing portal |
Here is a list of articles in the Approximation algorithms category of the Computing portal that unifies foundations of mathematics and computations using computers.
Pages in category "Approximation algorithms"
The following 34 pages are in this category, out of 34 total.
- Approximation algorithm (computing)
- Submodular set function (computing)
(
- (1+ε)-approximate nearest neighbor search (computing)
A
- Alpha max plus beta min algorithm (computing)
- Approximation-preserving reduction (computing)
- APX (computing)
B
- Baker's technique (computing)
- Bidimensionality (computing)
C
- Christofides algorithm (computing)
- Convex volume approximation (computing)
D
- Domination analysis (computing)
F
- Farthest-first traversal (computing)
G
- Gap reduction (computing)
- GNRS conjecture (computing)
H
- Hardness of approximation (computing)
K
- K-approximation of k-hitting set (computing)
- Karloff–Zwick algorithm (computing)
L
- L-reduction (computing)
M
- Method of conditional probabilities (computing)
- Methods of successive approximation (computing)
- Metric k-center (computing)
- Minimum k-cut (computing)
- Minimum relevant variables in linear system (computing)
- Multi-fragment algorithm (computing)
N
- Nearest neighbor search (computing)
- Nearest neighbour algorithm (computing)
P
- Polynomial-time approximation scheme (computing)
- Property testing (computing)
- PTAS reduction (computing)
S
- Set cover problem (computing)
- Shortest common supersequence problem (computing)
T
- Token reconfiguration (computing)
U
- Unique games conjecture (computing)
V
- Vertex k-center problem (computing)