A constant-factor approximation for weighted bond cover
From MaRDI portal
Publication:6671673
Recommendations
- Polylogarithmic Approximation Algorithms for Weighted-ℱ-deletion Problems
- Polylogarithmic approximation algorithms for weighted-\(\mathcal{F}\)-deletion problems
- Towards constant-factor approximation for chordal/distance-hereditary vertex deletion
- Hitting forbidden minors: approximation and kernelization
- Hitting forbidden minors: approximation and kernelization
Cites work
- scientific article; zbMATH DE number 3889282 (Why is no real title available?)
- scientific article; zbMATH DE number 1445293 (Why is no real title available?)
- (Meta) kernelization
- A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
- A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary
- A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs
- A tight Erdős-Pósa function for planar minors
- Approximation Schemes via Width/Weight Trade-offs on Minor-free Graphs
- Approximation and intractability results for the maximum cut problem and its variants
- Approximation and kernelization for chordal vertex deletion
- Characterizing multiterminal flow networks and computing flows in networks of small treewidth
- Compression via Matroids
- Edge degeneracy: algorithmic and structural results
- Feedback vertex set inspired kernel for chordal vertex deletion
- Finding odd cycle transversals.
- Graph minors. V. Excluding a planar graph
- Graph minors. XX: Wagner's conjecture
- Hitting diamonds and growing cacti
- Hitting forbidden minors: approximation and kernelization
- Hitting minors on bounded treewidth graphs. I: General upper bounds
- Hitting topological minors is FPT
- Interval vertex deletion admits a polynomial kernel
- LP-based robust algorithms for noisy minor-free and bounded treewidth graphs
- Linear recognition of almost interval graphs
- Losing Treewidth by Separating Subsets
- Mimicking Networks and Succinct Representations of Terminal Cuts
- On interval routing schemes and treewidth
- Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem
- Polylogarithmic approximation algorithms for weighted-\(\mathcal{F}\)-deletion problems
- Properties of vertex packing and independence system polyhedra
- The approximation of maximum subgraph problems
- The disjoint paths problem in quadratic time
- The extremal function for complete minors
- The node-deletion problem for hereditary properties is NP-complete
- Which problems have strongly exponential complexity?
This page was built for publication: A constant-factor approximation for weighted bond cover
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6671673)
