Parameterized Approximation via Fidelity Preserving Transformations

DOI10.1007/978-3-642-31594-7_30zbMath1272.68459OpenAlexW1749371477WikidataQ57359630 ScholiaQ57359630MaRDI QIDQ2843261

Michael R. Fellows, Ariel Kulik, Frances A. Rosamond, Hadas Shachnai

Publication date: 12 August 2013

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31594-7_30

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25)

Related Items (11)

Maximum Minimal Vertex Cover Parameterized by Vertex Cover ⋮ Parameterized approximation algorithms for packing problems ⋮ Time-approximation trade-offs for inapproximable problems ⋮ Maximum Minimal Vertex Cover Parameterized by Vertex Cover ⋮ A novel parameterised approximation algorithm for \textsc{minimum vertex cover} ⋮ Parameterized approximation via fidelity preserving transformations ⋮ Super-polynomial approximation branching algorithms ⋮ Fractals for Kernelization Lower Bounds ⋮ On the max min vertex cover problem ⋮ Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack ⋮ New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set

This page was built for publication: Parameterized Approximation via Fidelity Preserving Transformations