Parameterized approximation via fidelity preserving transformations

DOI10.1007/978-3-642-31594-7_30MaRDI QIDQ2843261zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Michael R. Fellows, Ariel Kulik, Frances 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)

Recommendations

• Parameterized approximation via fidelity preserving transformations
• Lossy kernelization
• Combining Two Worlds: Parameterised Approximation for Vertex Cover
• A novel parameterised approximation algorithm for \textsc{minimum vertex cover}
• Saving on phases: parameterized approximation for total vertex cover

Cited in

(12)

• A novel parameterised approximation algorithm for \textsc{minimum vertex cover}
• Parameterized approximation algorithms for packing problems
• Super-polynomial approximation branching algorithms
• New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set
• Maximum minimal vertex cover parameterized by vertex cover
• Time-approximation trade-offs for inapproximable problems
• Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack
• Parameterized approximation via fidelity preserving transformations
• On the max min vertex cover problem
• Fractals for kernelization lower bounds
• Maximum minimal vertex cover parameterized by vertex cover
• Improved approximation for transformation diagnostics

This page was built for publication: Parameterized approximation via fidelity preserving transformations

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