Pages that link to "Item:Q1273087"

The following pages link to A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs (Q1273087):

Displayed 35 items.

• Improved approximation for orienting mixed graphs (Q261342) ‎ (← links)
• Packing cycles exactly in polynomial time (Q421271) ‎ (← links)
• Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem (Q444386) ‎ (← links)
• A fixed-parameter algorithm for the vertex cover \(P_3\) problem (Q477591) ‎ (← links)
• Planar feedback vertex set and face cover: combinatorial bounds and subexponential algorithms (Q547307) ‎ (← links)
• A primal-dual approximation algorithm for the vertex cover \(P^3\) problem (Q650946) ‎ (← links)
• A linear time algorithm for the minimum-weight feedback vertex set problem in series-parallel graphs (Q705040) ‎ (← links)
• Disjoint cycles intersecting a set of vertices (Q713977) ‎ (← links)
• On the feedback vertex set polytope of a series-parallel graph (Q834183) ‎ (← links)
• Using fractional primal-dual to schedule split intervals with demands (Q865744) ‎ (← links)
• On the minimum feedback vertex set problem: Exact and enumeration algorithms (Q958216) ‎ (← links)
• Efficient algorithm for the vertex cover \(P_k\) problem on cacti (Q1739987) ‎ (← links)
• Two feedback problems for graphs with bounded tree-width (Q1764384) ‎ (← links)
• A factor \(2\) approximation algorithm for the vertex cover \(P_3\) problem (Q1944113) ‎ (← links)
• Solving the feedback vertex set problem on undirected graphs (Q1975362) ‎ (← links)
• On the complexity of singly connected vertex deletion (Q2089067) ‎ (← links)
• Approximation algorithms for hitting subgraphs (Q2115875) ‎ (← links)
• The size of graphs with given feedback vertex number (Q2127624) ‎ (← links)
• Improved approximation algorithms for hitting 3-vertex paths (Q2191773) ‎ (← links)
• An approximation algorithm for the \(l\)-pseudoforest deletion problem (Q2285146) ‎ (← links)
• Fixed-parameter tractability for subset feedback set problems with parity constraints (Q2344735) ‎ (← links)
• The vertex cover \(P_3\) problem in cubic graphs (Q2444740) ‎ (← links)
• Hitting Forbidden Minors: Approximation and Kernelization (Q2790404) ‎ (← links)
• Half-integrality, LP-branching, and FPT Algorithms (Q2816829) ‎ (← links)
• Euler Digraphs (Q3120436) ‎ (← links)
• A Linear Kernel for Planar Feedback Vertex Set (Q3503587) ‎ (← links)
• A primal-dual approach to approximation of node-deletion problems for matroidal properties (Q4572003) ‎ (← links)
• On the Complexity of Singly Connected Vertex Deletion (Q5041193) ‎ (← links)
• A naive algorithm for feedback vertex set (Q5240414) ‎ (← links)
• Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms (Q5302061) ‎ (← links)
• Inapproximability of $H$-Transversal/Packing (Q5348212) ‎ (← links)
• (Q5743513) ‎ (← links)
• Constant factor approximation for tracking paths and fault tolerant feedback vertex set (Q5918533) ‎ (← links)
• Constant factor approximation for tracking paths and fault tolerant feedback vertex set (Q5925624) ‎ (← links)
• MIP formulations for induced graph optimization problems: a tutorial (Q6056886) ‎ (← links)