Approximation algorithms inspired by kernelization methods

DOI10.1007/978-3-319-13075-0_38MaRDI QIDQ2942653zbMATH OpenOpenAlexFDO

Authors Faisal N. Abu-Khzam, Morgan Chopin, Henning Fernau, Cristina Bazgan

Publication date 11 September 2015

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://basepub.dauphine.fr/handle/123456789/16162

Mathematics Subject Classification ID

Parameterized complexity, tractability and kernelization (68Q27) Approximation algorithms (68W25)

Recommendations

• Data reductions and combinatorial bounds for improved approximation algorithms
• Lossy kernelization
• Safe approximation and its relation to kernelization
• Combining Two Worlds: Parameterised Approximation for Vertex Cover
• Fixed-Parameter Approximation: Conceptual Framework and Approximability Results

Cited in

(4)

• Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds
• On the complexity landscape of the domination chain
• scientific article; zbMATH DE number 6781341 (Why is no real title available?)
• Data reductions and combinatorial bounds for improved approximation algorithms

This page was built for publication: Approximation algorithms inspired by kernelization methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942653)