# Questions tagged [approximation-algorithms]

An approximation algorithm is an algorithm that finds an approximate solution to a (typically NP-hard) problem. The quality of the algorithm is measured by how close to the actual optimum it performs. For example, it is a constant factor approximation algorithm if it always outputs a solution that is within a constant factor of the optimum. Hardness of approximation is one way to separate NP-hard problems.

**10**

**1**answer

### Confusion with practically implementing rational approximations

**6**

**0**answers

### Any approximation algorithms for self-avoiding walks?

**5**

**1**answer

### Searching for an inhomogeneous diophantine approximation algorithm

**4**

**2**answers

### Can you solve this problem using a finite number of queries?

**2**

**3**answers

### Determining Roots of a Polynomial with Interval Estimates of Coefficients

**1**

**0**answers

### Minimum delay path in time-dependent graph

**5**

**1**answer

### Hypergraph Chromatic Number vs Degree, Clique-Size

**3**

**3**answers

### Detecting slow growth in a finite number of queries

**3**

**2**answers

### Approximation of curves

**2**

**0**answers

### Can one optimize the probability that an identity is satisfied until the probability is $1$?

**0**

**2**answers