Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs

1995 ◽  
pp. 142-151 ◽  
Author(s):  
Vineet Bafna ◽  
Piotr Berman ◽  
Toshihiro Fujito
Keyword(s):  
Constant Ratio ◽  
Undirected Graphs ◽  
Feedback Vertex Set ◽  
Vertex Set ◽  
Feedback Vertex Set Problem

scholarly journals Solving the feedback vertex set problem on undirected graphs

2000 ◽  
Vol 101 (1-3) ◽  
pp. 37-51 ◽  
Author(s):  
Lorenzo Brunetta ◽  
Francesco Maffioli ◽  
Marco Trubian
Keyword(s):  
Undirected Graphs ◽  
Feedback Vertex Set ◽  
Vertex Set ◽  
Feedback Vertex Set Problem

scholarly journals Tight Localizations of Feedback Sets

2021 ◽  
Vol 26 ◽  
pp. 1-19
Author(s):  
Michael Hecht ◽  
Krzysztof Gonciarz ◽  
Szabolcs Horvát
Keyword(s):  
Lower Bound ◽  
Error Bounds ◽  
Empirical Validation ◽  
Constant Ratio ◽  
Circuit Testing ◽  
Feedback Vertex Set ◽  
Sparse Graphs ◽  
Feedback Arc Set ◽  
Vertex Set ◽  
Feedback Vertex Set Problem

The classical NP–hard feedback arc set problem (FASP) and feedback vertex set problem (FVSP) ask for a minimum set of arcs ε ⊆ E or vertices ν ⊆ V whose removal G ∖ ε, G ∖ ν makes a given multi–digraph G =( V , E ) acyclic, respectively. Though both problems are known to be APX–hard, constant ratio approximations or proofs of inapproximability are unknown. We propose a new universal O (| V || E | 4 )–heuristic for the directed FASP. While a ratio of r ≈ 1.3606 is known to be a lower bound for the APX–hardness, at least by empirical validation we achieve an approximation of r ≤ 2. Most of the relevant applications, such as circuit testing , ask for solving the FASP on large sparse graphs, which can be done efficiently within tight error bounds with our approach.

A primal–dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs

1998 ◽  
Vol 22 (4-5) ◽  
pp. 111-118 ◽  
Author(s):  
Fabián A. Chudak ◽  
Michel X. Goemans ◽  
Dorit S. Hochbaum ◽  
David P. Williamson
Keyword(s):  
Approximation Algorithms ◽  
Undirected Graphs ◽  
Feedback Vertex Set ◽  
Vertex Set ◽  
Primal Dual ◽  
Feedback Vertex Set Problem ◽  
Dual Interpretation

Parameterized complexity of fair feedback vertex set problem

2021 ◽  
Vol 867 ◽  
pp. 1-12
Author(s):  
Lawqueen Kanesh ◽  
Soumen Maity ◽  
Komal Muluk ◽  
Saket Saurabh
Keyword(s):  
Parameterized Complexity ◽  
Feedback Vertex Set ◽  
Vertex Set ◽  
Feedback Vertex Set Problem

A Hybrid Immunological Search for the Weighted Feedback Vertex Set Problem

2020 ◽  
pp. 1-16
Author(s):  
Vincenco Cutello ◽  
Maria Oliva ◽  
Mario Pavone ◽  
Rocco A. Scollo
Keyword(s):  
Feedback Vertex Set ◽  
Vertex Set ◽  
Feedback Vertex Set Problem

An O(2 O(k) n 3) FPT Algorithm for the Undirected Feedback Vertex Set Problem

2005 ◽  
pp. 859-869 ◽  
Author(s):  
Frank Dehne ◽  
Michael Fellows ◽  
Michael A. Langston ◽  
Frances Rosamond ◽  
Kim Stevens
Keyword(s):  
Feedback Vertex Set ◽  
Fpt Algorithm ◽  
Vertex Set ◽  
Feedback Vertex Set Problem

The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel

2006 ◽  
pp. 192-202 ◽  
Author(s):  
Kevin Burrage ◽  
Vladimir Estivill-Castro ◽  
Michael Fellows ◽  
Michael Langston ◽  
Shev Mac ◽  
...  
Keyword(s):  
Feedback Vertex Set ◽  
Vertex Set ◽  
Feedback Vertex Set Problem
Sign in / Sign up

Export Citation Format

Share Document