Pages that link to "Item:Q6487955"
From MaRDI portal
The following pages link to Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs (Q6487955):
Displaying 19 items.
- A note on approximation of the vertex cover and feedback vertex set problems -- Unified approach (Q671377) (← links)
- Disjoint cycles intersecting a set of vertices (Q713977) (← links)
- Approximating the minimum weight weak vertex cover (Q860818) (← links)
- Combinatorial algorithms for feedback problems in directed graphs (Q1007586) (← links)
- A linear time algorithm for the minimum weighted feedback vertex set on diamonds (Q1041719) (← links)
- A unified approximation algorithm for node-deletion problems (Q1270821) (← links)
- A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs (Q1273087) (← links)
- On approximability of linear ordering and related NP-optimization problems on graphs. (Q1427183) (← links)
- Approximating minimum feedback vertex sets in hypergraphs (Q1583598) (← links)
- Minimum feedback vertex set and acyclic coloring. (Q1853123) (← links)
- Solving the feedback vertex set problem on undirected graphs (Q1975362) (← links)
- The size of graphs with given feedback vertex number (Q2127624) (← links)
- Polynomial time algorithms for tracking path problems (Q2144269) (← links)
- Min (a)cyclic feedback vertex sets and MIN ones monotone 3-SAT (Q2632009) (← links)
- A primal-dual approach to approximation of node-deletion problems for matroidal properties (Q4572003) (← links)
- Primal-dual approximation algorithms for feedback problems in planar graphs (Q4645920) (← links)
- Polynomial Time Algorithms for Tracking Path Problems (Q5041188) (← links)
- Inapproximability of $H$-Transversal/Packing (Q5348212) (← links)
- Approximability of the independent feedback vertex set problem for bipartite graphs (Q5919046) (← links)
