In computer science, particularly the study of approximation algorithms, an L-reduction ("linear reduction") is a transformation of optimization problems which linearly preserves approximability features; it is one type of approximation-preserving reduction. L-reductions in studies of approximability of optimization problems play a similar role to that of polynomial reductions in the studies of computational complexity of decision problems. The term L reduction is sometimes used to refer to log-space reductions, by analogy with the complexity class L, but this is a different concept.
Definition
Before giving the definition, we recall some concepts of optimization problems, illustrated with the travelling salesman problem (TSP). First an instance is the input of the problem, i.e. the information we need to compute a solution. An instance for TSP is a finite set of cities and the distances between them. A solution is a tour that visits all the cities. In the case of TSP, the cost of a solution is the length of the tour. We write O P T T S P ( x ) {\displaystyle \mathrm {OPT_{TSP}} (x)} to be the cost of an optimal solution, i.e. the length of a shortest tour. Let A and B be optimization problems and cA and cB their respective cost functions. A pair of functions f and g is an L-reduction if all of the following conditions are met:
functions f and g are computable in polynomial time, if x is an instance of problem A, then f(x) is an instance of problem B, if y' is a solution to f(x), then g(y' ) is a solution to x, there exists a positive constant α such that
O P T B ( f ( x ) ) ≤ α O P T A ( x ) {\displaystyle \mathrm {OPT_{B}} (f(x))\leq \alpha \mathrm {OPT_{A}} (x)} , there exists a positive constant β such that for every solution y' to f(x)
| O P T A ( x ) − c A ( g ( y ′ ) ) | ≤ β | O P T B ( f ( x ) ) − c B ( y ′ ) | {\displaystyle |\mathrm {OPT_{A}} (x)-c_{A}(g(y'))|\leq \beta |\mathrm {OPT_{B}} (f(x))-c_{B}(y')|} .
Example Here is a L-reduction from MAX 3-SAT to MAX 2-SAT. Consider a MAX 3-SAT instance φ := ⋀ i = 1 m ( ℓ i 1 ∨ ℓ i 2 ∨ ℓ i 3 ) {\displaystyle \varphi :=\bigwedge _{i=1}^{m}(\ell _{i}^{1}\lor \ell _{i}^{2}\lor \ell _{i}^{3})} where ℓ i 1 {\displaystyle \ell _{i}^{1}} , ℓ i 2 {\displaystyle \ell _{i}^{2}} and ℓ i 3 {\displaystyle \ell _{i}^{3}} are literals. The function f {\displaystyle f} of our L-reduction is defined as follows. The MAX 2-SAT instance f ( φ ) {\displaystyle f(\varphi )} is the formula:
… excerpt ends here. Continue reading the full article.

