26

Approximation Algorithms for the Vertex Feedback Set Problem with Applications to Constraint Satisfaction and Bayesian Inference
–

7074

Probabilistic Reasoning in Intelligent Systems
–
 1988

1290

Local computation with probabilities on graphical structures and their application to expert systems
–
 1988

21

Constant Ratio Approximations of the Weighted Feedback . . .
–

21

PrimalDual Approximation Algorithms for Feedback Problems in Planar Graphs
–
 1996

10964

Computers and Intractability: A Guide to the Theory of NPCompleteness
–
 1979

873

Parameterized Complexity
–
 1998

307

Approximation algorithms for NPcomplete problems on planar graphs
–
 1994

19

A PrimalDual Interpretation of Two 2Approximation Algorithms for the Feedback Vertex Set Problem in Undirected Graphs
–

239

An Approximate MaxFlow MinCut Theorem For Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms
–
 1988

29

An o(2 O(k) n 3 ) fpt algorithm for the undirected feedback vertex set problem
–

120

THE PRIMALDUAL METHOD FOR APPROXIMATION ALGORITHMS AND ITS APPLICATION TO NETWORK DESIGN PROBLEMS
–

80

A primaldual approximation algorithm for generalized Steiner network problems
–
 1995

36

On the maximal number of disjoint circuits of a graph
–
 1962

67

A 2approximation algorithm for the undirected feedback vertex set problem
–
 1999

155

A localratio theorem for approximating the weighted vertex cover problem
–
 1985

271

Bucket Elimination: A Unifying Framework for Reasoning
–

469

Reducibility among combinatorial problems. In Complexity of Computer Computations
–
 1972

10

On heuristics for finding loop cutsets in multiply connected belief networks
–
 1990
