A constant-factor approximation for weighted bond cover

Cites Work

Properties of vertex packing and independence system polyhedra
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
Finding odd cycle transversals.
Graph minors. XX: Wagner's conjecture
The node-deletion problem for hereditary properties is NP-complete
A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs
Which problems have strongly exponential complexity?
The extremal function for complete minors
A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
Title not available (Why is that?)
Graph minors. V. Excluding a planar graph
The disjoint paths problem in quadratic time
Title not available (Why is that?)
Hitting and Harvesting Pumpkins
Hitting forbidden minors: approximation and kernelization
Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions
The approximation of maximum subgraph problems
Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem
Hitting diamonds and growing cacti
Characterizing multiterminal flow networks and computing flows in networks of small treewidth
Approximation and intractability results for the maximum cut problem and its variants
Linear Recognition of Almost Interval Graphs
Compression via Matroids
(Meta) Kernelization
Approximation and Kernelization for Chordal Vertex Deletion
Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion
Approximation Schemes via Width/Weight Trade-offs on Minor-free Graphs
On interval routing schemes and treewidth
A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion
Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds
LP-Based Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs
A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary
Interval Vertex Deletion Admits a Polynomial Kernel
Hitting topological minors is FPT
Losing Treewidth by Separating Subsets
Title not available (Why is that?)
Edge degeneracy: algorithmic and structural results
A tight Erdős-Pósa function for planar minors
Mimicking Networks and Succinct Representations of Terminal Cuts

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)