Next Article in Journal
Local Comparison between Two Ninth Convergence Order Algorithms for Equations
Next Article in Special Issue
Special Issue “New Frontiers in Parameterized Complexity and Algorithms”: Foreward by the Guest Editors
Previous Article in Journal
Binary Time Series Classification with Bayesian Convolutional Neural Networks When Monitoring for Marine Gas Discharges
Previous Article in Special Issue
Parameterized Optimization in Uncertain Graphs—A Survey and Some Results
Article

A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms

1
Department of Applied Mathematics (KAM), Charles University, 118 00 Prague, Czech Republic
2
Department of Computer Science, Tel Aviv University, Tel Aviv 6997801, Israel
3
Courant Institute of Mathematical Sciences, New York University, New York, NY 10012, USA
4
Google Research, Mountain View, CA 94043, USA
*
Authors to whom correspondence should be addressed.
Algorithms 2020, 13(6), 146; https://doi.org/10.3390/a13060146
Received: 1 October 2019 / Revised: 31 May 2020 / Accepted: 2 June 2020 / Published: 19 June 2020
(This article belongs to the Special Issue New Frontiers in Parameterized Complexity and Algorithms)
Parameterization and approximation are two popular ways of coping with NP-hard problems. More recently, the two have also been combined to derive many interesting results. We survey developments in the area both from the algorithmic and hardness perspectives, with emphasis on new techniques and potential future research directions. View Full-Text
Keywords: parameterized complexity; approximation algorithms; hardness of approximation parameterized complexity; approximation algorithms; hardness of approximation
MDPI and ACS Style

Feldmann, A.E.; Karthik C. S.; Lee, E.; Manurangsi, P. A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms. Algorithms 2020, 13, 146. https://doi.org/10.3390/a13060146

AMA Style

Feldmann AE, Karthik C. S., Lee E, Manurangsi P. A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms. Algorithms. 2020; 13(6):146. https://doi.org/10.3390/a13060146

Chicago/Turabian Style

Feldmann, Andreas E., Karthik C. S., Euiwoong Lee, and Pasin Manurangsi. 2020. "A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms" Algorithms 13, no. 6: 146. https://doi.org/10.3390/a13060146

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop