Pages that link to "Item:Q4699157"
From MaRDI portal
The following pages link to A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem (Q4699157):
Displaying 50 items.
- Improved approximation for orienting mixed graphs (Q261342) (← links)
- Scattered packings of cycles (Q306707) (← links)
- Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter (Q372970) (← links)
- Approximation algorithms for orienting mixed graphs (Q390889) (← links)
- Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem (Q444386) (← links)
- Cycle bases in graphs characterization, algorithms, complexity, and applications (Q458496) (← links)
- A fixed-parameter algorithm for the vertex cover \(P_3\) problem (Q477591) (← links)
- The decycling number of generalized Petersen graphs (Q479058) (← links)
- Decycling bubble sort graphs (Q494444) (← links)
- On feedback vertex set: new measure and new structures (Q494933) (← links)
- On making a distinguished vertex of minimum degree by vertex deletion (Q528861) (← links)
- Tradeoffs in process strategy games with application in the WDM reconfiguration problem (Q638539) (← links)
- A primal-dual approximation algorithm for the vertex cover \(P^3\) problem (Q650946) (← links)
- Combination of parallel machine scheduling and vertex cover (Q690471) (← links)
- An efficient approximation for the generalized assignment problem (Q845859) (← links)
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization (Q856420) (← links)
- Using fractional primal-dual to schedule split intervals with demands (Q865744) (← links)
- Feedback numbers of Kautz digraphs (Q879335) (← links)
- Refining the complexity of the sports elimination problem (Q896666) (← links)
- Improved approximation algorithm for convex recoloring of trees (Q927405) (← links)
- Feedback vertex set on AT-free graphs (Q944750) (← links)
- Improved algorithms for feedback vertex set problems (Q955350) (← links)
- On the minimum feedback vertex set problem: Exact and enumeration algorithms (Q958216) (← links)
- A cubic kernel for feedback vertex set and loop cutset (Q968273) (← links)
- Feedback numbers of de Bruijn digraphs (Q980262) (← links)
- Minimum feedback vertex sets in shuffle-based interconnection networks (Q1007599) (← links)
- Resource allocation in bounded degree trees (Q1024215) (← links)
- Feedback vertex sets in star graphs (Q1029080) (← links)
- A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs (Q1273087) (← links)
- Flexible bandwidth assignment with application to optical networks (Q1617285) (← links)
- On residual approximation in solution extension problems (Q1631675) (← links)
- Kernels for deletion to classes of acyclic digraphs (Q1678165) (← links)
- A faster parameterized algorithm for pseudoforest deletion (Q1693129) (← links)
- Efficient algorithm for the vertex cover \(P_k\) problem on cacti (Q1739987) (← links)
- Polynomial kernels for deletion to classes of acyclic digraphs (Q1751231) (← links)
- An improved FPT algorithm for almost forest deletion problem (Q1751414) (← links)
- The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs (Q1756342) (← links)
- New algorithms for maximum disjoint paths based on tree-likeness (Q1785205) (← links)
- New bounds on the size of the minimum feedback vertex set in meshes and butterflies. (Q1853082) (← links)
- A factor \(2\) approximation algorithm for the vertex cover \(P_3\) problem (Q1944113) (← links)
- Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem (Q2028800) (← links)
- On the complexity of singly connected vertex deletion (Q2089067) (← links)
- Polynomial time algorithms for tracking path problems (Q2144269) (← links)
- On the feedback number of 3-uniform linear extremal hypergraphs (Q2150590) (← links)
- Tracking paths (Q2185723) (← links)
- Local search is a PTAS for feedback vertex set in minor-free graphs (Q2197532) (← links)
- On the tractability of \(( k , i )\)-coloring (Q2235289) (← links)
- An approximation algorithm for the \(l\)-pseudoforest deletion problem (Q2285146) (← links)
- Parameterised algorithms for deletion to classes of DAGs (Q2322699) (← links)
- Fixed-parameter tractability for subset feedback set problems with parity constraints (Q2344735) (← links)
