Logo image
Back
A survey on approximation in parameterized complexity: hardness and algorithms
Journal article   Open access   Peer reviewed

A survey on approximation in parameterized complexity: hardness and algorithms

Andreas Emil Feldmann, C. S. Karthik, Euiwoong Lee and Pasin Manurangsi
Algorithms, Vol.13(6), p.146
06/01/2020
DOI: https://doi.org/10.3390/a13060146

Abstract

Computer Science, Artificial Intelligence Computer Science, Theory & Methods Science & Technology Computer Science Technology
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.
pdf
algorithms-13-00146-v2754.45 kBDownloadView
Version of Record (VoR) Open Access CC BY V4.0
url
https://doi.org/10.3390/a13060146View
Version of Record (VoR) Algorithms Open
url
Report an accessibility issueView
Please complete a content remediation request to report an accessibility issue with a library electronic resource, website, or service.

Metrics

Details

Logo image