Efficient parameterized approximation
From MaRDI portal
Cites work
- \(O(\sqrt{\log n})\) approximation algorithms for Min UnCut, Min 2CNF deletion, and directed cut problems
- A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
- A constructive proof of Vizing's theorem
- A tight approximation algorithm for the cluster vertex deletion problem
- Approximating V<scp>ertex</scp> C<scp>over</scp> using Structural Rounding
- Complement reducible graphs
- Compression via Matroids
- Faster parameterized algorithms using linear programming
- FPT approximations for packing and covering problems parameterized by elimination distance and even less
- scientific article; zbMATH DE number 1256776 (Why is no real title available?)
- scientific article; zbMATH DE number 7525474 (Why is no real title available?)
- Linear recognition of almost interval graphs
- Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion
- Maximum edge-disjoint paths in k-sums of graphs
- New algorithms for maximum disjoint paths based on tree-likeness
- On routing disjoint paths in bounded treewidth graphs
- On temporal graph exploration
- Optimal Long Code Test with One Free Bit
- Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem
- Parameterized algorithms
- Polynomial-time approximation of independent set parameterized by treewidth
- Properties of vertex packing and independence system polyhedra
- Round and bipartize for vertex cover approximation
- Some simplified NP-complete graph problems
- The complexity of König subgraph problems and above-guarantee vertex cover
- The NP-Completeness of Edge-Coloring
- Tree deletion set has a polynomial kernel but no \(\mathrm{OPT}^\mathcal{O}(1)\) approximation)
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
- Vertex packings: Structural properties and algorithms
This page was built for publication: Efficient parameterized approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7294442)
