Parameterized Approximation via Fidelity Preserving Transformations
From MaRDI portal
Publication:2843261
DOI10.1007/978-3-642-31594-7_30zbMath1272.68459WikidataQ57359630 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
Related Items
Maximum Minimal Vertex Cover Parameterized by Vertex Cover, Fractals for Kernelization Lower Bounds, Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack, Parameterized approximation algorithms for packing problems, A novel parameterised approximation algorithm for \textsc{minimum vertex cover}, On the max min vertex cover problem, Time-approximation trade-offs for inapproximable problems, Parameterized approximation via fidelity preserving transformations, New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set, Maximum Minimal Vertex Cover Parameterized by Vertex Cover, Super-polynomial approximation branching algorithms