Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem
- 1 May 1996
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 83 (1) , 167-188
- https://doi.org/10.1016/0004-3702(95)00004-6
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian InferenceSIAM Journal on Computing, 1998
- Introduction to AlgorithmsJournal of the Operational Research Society, 1991
- Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference.The Journal of Philosophy, 1991
- An algebra of bayesian belief universes for knowledge‐based systemsNetworks, 1990
- Identifying independence in bayesian networksNetworks, 1990
- Enhancement schemes for constraint processing: Backjumping, learning, and cutset decompositionArtificial Intelligence, 1990
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987
- Fusion, propagation, and structuring in belief networksArtificial Intelligence, 1986
- A modification of the greedy algorithm for vertex coverInformation Processing Letters, 1983
- A Greedy Heuristic for the Set-Covering ProblemMathematics of Operations Research, 1979