Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
oaioai:mdpi.com:/1999-4893/13/6/146/

A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms

Authors
Publication date
19 June 2020
Publisher
'MDPI AG'
Doi

    Abstract

    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

    Similar works

    Full text

    thumbnail-image

    Multidisciplinary Digital Publishing Institute

    redirect
    oaioai:mdpi.com:/1999-4893/13/6/1...
    Last time updated on 20/10/2022

    This paper was published in Multidisciplinary Digital Publishing Institute.

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.