Approximation Algorithms for the Loop Cutset Problem
- 1 January 1994
- book chapter
- Published by Elsevier
Abstract
No abstract availableKeywords
All Related Versions
This publication has 9 references indexed in Scilit:
- Identifying independence in bayesian networksNetworks, 1990
- Probabilistic inference in multiply connected belief networks using loop cutsetsInternational Journal of Approximate Reasoning, 1990
- Enhancement schemes for constraint processing: Backjumping, learning, and cutset decompositionArtificial Intelligence, 1990
- Local Computations with Probabilities on Graphical Structures and Their Application to Expert SystemsJournal of the Royal Statistical Society Series B: Statistical Methodology, 1988
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987
- Evaluating Influence DiagramsOperations Research, 1986
- 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