Approximation Algorithms for the Loop Cutset Problem

[1]  Reuven Bar-Yehuda,et al.  Approximation algorithms for the vertex feedback set problem with applications to constraint satisfaction and Bayesian inference , 1994, SODA '94.

[2]  Rajeev Motwani,et al.  Lecture notes on approximation algorithms: Volume I , 1993 .

[3]  Jonathan Stillman,et al.  On Heuristics for Finding Loop Cutsets in Multiply-Connected Belief Networks , 2013, UAI 1990.

[4]  Dan Geiger,et al.  Identifying independence in bayesian networks , 1990, Networks.

[5]  Behzad Parviz,et al.  On heuristics for finding loop cutsets in multiply-connected belief networks , 1990, UAI.

[6]  Gregory F. Cooper,et al.  Probabilistic inference in multiply connected belief networks using loop cutsets , 1990, Int. J. Approx. Reason..

[7]  Rina Dechter,et al.  Enhancement Schemes for Constraint Processing: Backjumping, Learning, and Cutset Decomposition , 1990, Artif. Intell..

[8]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[9]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[10]  V. Rich.  Personal communication , 1989, Nature.

[11]  Judea Pearl,et al.  Causal networks: semantics and expressiveness , 2013, UAI.

[12]  Dan Geiger,et al.  On the logic of causal models , 2013, UAI.

[13]  David J. Spiegelhalter,et al.  Local computations with probabilities on graphical structures and their application to expert systems , 1990 .

[14]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

[15]  Ross D. Shachter.  Evaluating Influence Diagrams , 1986, Oper. Res..

[16]  Judea Pearl,et al.  Fusion, Propagation, and Structuring in Belief Networks , 1986, Artif. Intell..

[17]  Judea Pearl,et al.  A Computational Model for Causal and Diagnostic Reasoning in Inference Systems , 1983, IJCAI.

[18]  Kenneth L. Clarkson,et al.  A Modification of the Greedy Algorithm for Vertex Cover , 1983, Inf. Process. Lett..

[19]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[20]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[21]  J. Kellett.  London , 1914, The Hospital.