New complexity results for MAP in Bayesian networks

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2011, Pages 2100-2106

  De Campos, Cassio P ^a  

^a DALLE MOLLE INSTITUTE FOR ARTIFICIAL INTELLIGENCE IDSIA   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION SCHEME; BOUNDED TREEWIDTH; COMPLEXITY RESULTS; FULLY POLYNOMIAL TIME APPROXIMATION SCHEMES; MAXIMUM A POSTERIORI; NETWORK VARIABLES; NUMBER OF STATE; SIMPLE TOPOLOGY;

ARTIFICIAL INTELLIGENCE; BAYESIAN NETWORKS; BINARY TREES;

COMPLEX NETWORKS;

EID: 84867132452     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.5591/978-1-57735-516-8/IJCAI11-351     Document Type: Conference Paper

References (8)

1. H. L. Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth. In Proc. of STOC, pages 226-234, 1993. ACM.
2. A. Darwiche. Modeling and Reasoning with Bayesian Networks. Cambridge Univ. Press, 2009.
3. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979.
4. C. H. Papadimitriou and M. Yannakakis. On the approximability of trade-offs and optimal access of web sources. In Proc. of FOCS, page 86-92, 2000. IEEE Computer Society.
5. J. D. Park and A. Darwiche. Complexity results and approximation strategies for MAP explanations. J. Artif. Intell. Res., 21:101-133, 2004. (Pubitemid 41525899)
6. J. Pearl. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, 1988.
7. Prakash P. Shenoy. Binary join trees. In Proc. of UAI, pages 492-499, 1996.
8. V. V. Vazirani. Approximation Algorithms. Springer, 2001.