Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference
- 1 August 1998
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 27 (4) , 942-959
- https://doi.org/10.1137/s0097539796305109
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problemArtificial Intelligence, 1996
- A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex CoversJournal of Algorithms, 1994
- Approximation algorithms for NP-complete problems on planar graphsJournal of the ACM, 1994
- Identifying independence in bayesian networksNetworks, 1990
- Enhancement schemes for constraint processing: Backjumping, learning, and cutset decompositionArtificial Intelligence, 1990
- Network-based heuristics for constraint-satisfaction problemsArtificial Intelligence, 1987
- Fusion, propagation, and structuring in belief networksArtificial Intelligence, 1986
- On the ratio of optimal integral and fractional coversDiscrete Mathematics, 1975
- A new proof and generalizations of a theorem of Erdős and Pósa on graphs withoutk+1 independent circuitsActa Mathematica Hungarica, 1967
- On Independent Circuits Contained in a GraphCanadian Journal of Mathematics, 1965