A parameterized approximation algorithm is a type of algorithm that aims to find approximate solutions to NP-hard optimization problems in polynomial time in the input size and a function of a specific parameter. These algorithms are designed to combine the best aspects of both traditional approximation algorithms and fixed-parameter tractability.
In traditional approximation algorithms, the goal is to find solutions that are at most a certain factor α away from the optimal solution, known as an α-approximation, in polynomial time. On the other hand, parameterized algorithms are designed to find exact solutions to problems, but with the constraint that the running time of the algorithm is polynomial in the input size and a function of a specific parameter k. The parameter describes some property of the input and is small in typical applications. The problem is said to be fixed-parameter tractable (FPT) if there is an algorithm that can find the optimum solution in time, where is a function independent of the input size n.
A parameterized approximation algorithm aims to find a balance between these two approaches by finding approximate solutions in FPT time: the algorithm computes an α-approximation in time, where is a function independent of the input size n. This approach aims to overcome the limitations of both traditional approaches by having stronger guarantees on the solution quality compared to traditional approximations while still having efficient running times as in FPT algorithms. An overview of the research area studying parameterized approximation algorithms can be found in the survey of Marx[1] and the more recent survey by Feldmann et al.[2]
^Marx, Daniel (2008). "Parameterized Complexity and Approximation Algorithms". The Computer Journal. 51 (1): 60–78. doi:10.1093/comjnl/bxm048.
^Feldmann, Andreas Emil; Karthik C. S; Lee, Euiwoong; Manurangsi, Pasin (2020). "A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms". Algorithms. 13 (6): 146. arXiv:2006.04411. doi:10.3390/a13060146. ISSN 1999-4893. This article incorporates text from this source, which is available under the CC BY 4.0 license.
and 21 Related for: Parameterized approximation algorithm information
A parameterizedapproximationalgorithm is a type of algorithm that aims to find approximate solutions to NP-hard optimization problems in polynomial time...
In computer science and operations research, approximationalgorithms are efficient algorithms that find approximate solutions to optimization problems...
parameter k is fixed are called parameterized problems. A parameterized problem that allows for such an FPT algorithm is said to be a fixed-parameter...
fixed-parameter tractable. The longest path problem, parameterized by clique-width, is hard for the parameterized complexity class W [ 1 ] {\displaystyle W[1]}...
know quasi-polynomial time algorithms, but no polynomial time algorithm is known. Such problems arise in approximationalgorithms; a famous example is the...
polynomial time and find a solution that is close to optimal parameterizedapproximationalgorithms that run in FPT time and find a solution close to the optimum...
approximation algorithm achieves an approximation ratio strictly less than one. There is a simple randomized 0.5-approximationalgorithm: for each vertex...
APX-complete and thus does not admit a PTAS, unless P = NP. However, a parameterizedapproximation scheme exists, which for any ε > 0 {\displaystyle \varepsilon...
best known lower bound is Ω(n), but no matching algorithm is known for the case of k ≥ 3. Parameterized complexity is the complexity-theoretic study of...
several simple 2-factor approximations. It is a typical example of an NP-hard optimization problem that has an approximationalgorithm. Its decision version...
{\displaystyle \Gamma } . An instance of a parameterized problem consists of (x,k), where k is called the parameter. A parameterized problem Π {\displaystyle \Pi }...
recently used) approximations and working set algorithms. Since then, some basic assumptions made by the traditional page replacement algorithms were invalidated...
efficient algorithm that can compute γ(G) for all graphs G. However, there are efficient approximationalgorithms, as well as efficient exact algorithms for...
variables, each of which has a mean of θ. The gamma distribution can be parameterized in terms of a shape parameter α = k and an inverse scale parameter β...
P=NP. On the other hand, it was shown that a parameterized 3 / 2 {\displaystyle 3/2} -approximationalgorithm with a runtime of 2 O ( k h log h ) n O (...
assignment to the variables in the clauses. We say that an algorithm A provides an α-approximation to MAXEkSAT if, for some fixed positive α less than or...
International Symposium on Parameterized and Exact Computation, founded in 2004 and formerly the International Workshop on Parameterized and Exact Computation...
polynomial-time approximationalgorithm with a ratio smaller than 3 / 2 {\displaystyle 3/2} unless P = N P {\displaystyle P=NP} . However, the best approximation ratio...
is in P. Additive approximation of the Jones polynomial is BQP-complete, i.e., equivalently hard as polynomial time quantum algorithms. Given two (tame)...
often implemented as an A* search algorithm. In addition to exact algorithms, a number of efficient approximationalgorithms are also known. Most of them have...
Global Information
This article incorporates text from this source, which is available under the CC BY 4.0 license.
