A survey on approximation in parameterized complexity: hardness and algorithms

Feldmann, A.E. orcid.org/0000-0001-6229-5332, Karthik C. S., K.C., Lee, E. et al. (1 more author) (2020) A survey on approximation in parameterized complexity: hardness and algorithms. Algorithms, 13 (6). 146. ISSN 1999-4893

Abstract

Metadata

Authors/Creators:
Copyright, Publisher and Additional Information: © 2020 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/) which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Keywords: parameterized complexity; approximation algorithms; hardness of approximation
Dates:
  • Accepted: 2 June 2020
  • Published (online): 19 June 2020
  • Published: June 2020
Institution: The University of Sheffield
Academic Units: The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield)
Depositing User: Symplectic Sheffield
Date Deposited: 29 Jun 2023 10:02
Last Modified: 29 Jun 2023 10:02
Published Version: http://dx.doi.org/10.3390/a13060146
Status: Published
Publisher: MDPI AG
Refereed: Yes
Identification Number: https://doi.org/10.3390/a13060146
Related URLs:

Export

Statistics


CORE (COnnecting REpositories)