Combining Two Worlds: Parameterised Approximation for Vertex Cover

DOI10.1007/978-3-642-17517-6_35zbMath1310.68235OpenAlexW1582617592MaRDI QIDQ3060750

Ljiljana Brankovic, Henning Fernau

Publication date: 9 December 2010

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

Full work available at URL: https://doi.org/10.1007/978-3-642-17517-6_35

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (5)

Parameterized approximation algorithms for packing problems ⋮ A novel parameterised approximation algorithm for \textsc{minimum vertex cover} ⋮ Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem ⋮ Super-polynomial approximation branching algorithms ⋮ Moderately Exponential Approximation: Bridging the Gap Between Exact Computation and Polynomial Approximation

This page was built for publication: Combining Two Worlds: Parameterised Approximation for Vertex Cover