ML Anthology

Tree-Width and the Computational Complexity of MAP Approximations in Bayesian Networks

Johan Kwisthout
JAIR 2015 pp. 699-720
doi:10.1613/JAIR.4794 /jair/2015/kwisthout2015jair-treewidth/
JAIR Semantic Scholar

Cite

Text

Kwisthout. "Tree-Width and the Computational Complexity of MAP Approximations in Bayesian Networks." Journal of Artificial Intelligence Research, 2015. doi:10.1613/JAIR.4794

Markdown

[Kwisthout. "Tree-Width and the Computational Complexity of MAP Approximations in Bayesian Networks." Journal of Artificial Intelligence Research, 2015.](https://mlanthology.org/jair/2015/kwisthout2015jair-treewidth/) doi:10.1613/JAIR.4794

BibTeX

@article{kwisthout2015jair-treewidth,
  title     = {{Tree-Width and the Computational Complexity of MAP Approximations in Bayesian Networks}},
  author    = {Kwisthout, Johan},
  journal   = {Journal of Artificial Intelligence Research},
  year      = {2015},
  pages     = {699-720},
  doi       = {10.1613/JAIR.4794},
  volume    = {53},
  url       = {https://mlanthology.org/jair/2015/kwisthout2015jair-treewidth/}
}