Pages that link to "Item:Q4699157"

The following pages link to A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem (Q4699157):

Displaying 50 items.

• An improved exact algorithm for undirected feedback vertex set (Q2355979) (← links)
• New upper bounds on feedback vertex numbers in butterflies (Q2390267) (← links)
• On line graphs of subcubic triangle-free graphs (Q2400553) (← links)
• Parameterized complexity of secluded connectivity problems (Q2408560) (← links)
• Polynomial kernelizations for MIN \(F^{+}\Pi _{1}\) and MAX NP (Q2429346) (← links)
• Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization (Q2437764) (← links)
• The vertex cover \(P_3\) problem in cubic graphs (Q2444740) (← links)
• Approximation algorithm for the minimum weight connected \(k\)-subgraph cover problem (Q2447765) (← links)
• Admission control with advance reservations in simple networks (Q2466012) (← links)
• Efficient approximation of convex recolorings (Q2643731) (← links)
• Simultaneous feedback edge set: a parameterized perspective (Q2659779) (← links)
• A Turing kernelization dichotomy for structural parameterizations of \(\mathcal{F} \)-minor-free deletion (Q2662677) (← links)
• Towards a polynomial kernel for directed feedback vertex set (Q2663705) (← links)
• Preprocessing to reduce the search space: antler structures for feedback vertex set (Q2672419) (← links)
• Improved kernels for tracking paths (Q2681404) (← links)
• Circumventing connectivity for kernelization (Q2692730) (← links)
• Hitting forbidden minors: approximation and kernelization (Q2790404) (← links)
• An Improved Exact Algorithm for Undirected Feedback Vertex Set (Q2867116) (← links)
• Safe Approximation and Its Relation to Kernelization (Q2891346) (← links)
• Deterministic Algorithms for the Independent Feedback Vertex Set Problem (Q2946071) (← links)
• On Residual Approximation in Solution Extension Problems (Q2958338) (← links)
• Approximation Algorithms for Orienting Mixed Graphs (Q3011872) (← links)
• A Quartic Kernel for Pathwidth-One Vertex Deletion (Q3057625) (← links)
• Approximation Algorithms for Minimum Chain Vertex Deletion (Q3078376) (← links)
• Designing FPT Algorithms for Cut Problems Using Randomized Contractions (Q3187169) (← links)
• A spin glass approach to the directed feedback vertex set problem (Q3302766) (← links)
• A Linear Kernel for Planar Feedback Vertex Set (Q3503587) (← links)
• Iterative Compression for Exactly Solving NP-Hard Minimization Problems (Q3637312) (← links)
• Approximation and Kernelization for Chordal Vertex Deletion (Q4586151) (← links)
• FPT Algorithms for FVS Parameterized by Split and Cluster Vertex Deletion Sets and Other Parameters (Q4632216) (← links)
• MINIMUM FEEDBACK ARC SETS IN ROTATOR AND INCOMPLETE ROTATOR GRAPHS (Q4902886) (← links)
• (Q5009491) (← links)
• On the Complexity of Singly Connected Vertex Deletion (Q5041193) (← links)
• Hitting Weighted Even Cycles in Planar Graphs (Q5048307) (← links)
• (Q5075825) (← links)
• Decycling bipartite graphs (Q5084689) (← links)
• (Q5089163) (← links)
• Tight Localizations of Feedback Sets (Q5102049) (← links)
• (Q5111250) (← links)
• Achieving a global objective with competing networked agents in the framework of discrete event systems (Q5221385) (← links)
• Tracking Paths (Q5283356) (← links)
• Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs (Q5452161) (← links)
• (Q5688508) (← links)
• (Q5708559) (← links)
• Tree Deletion Set Has a Polynomial Kernel but No $\text{OPT}^\mathcal{O}(1)$ Approximation) (Q5741082) (← links)
• (Q5743513) (← links)
• Constant factor approximation for tracking paths and fault tolerant feedback vertex set (Q5918533) (← links)
• Approximability of the independent feedback vertex set problem for bipartite graphs (Q5919046) (← links)
• A polynomial sized kernel for tracking paths problem (Q5919306) (← links)
• Constant factor approximation for tracking paths and fault tolerant feedback vertex set (Q5925624) (← links)