ML Anthology

Approximation Algorithms for Max-Sum-Product Problems

Denis Deratani Mauá
IJCAI 2013 pp. 3235-3236
/ijcai/2013/maua2013ijcai-approximation/

Abstract

Many tasks in probabilistic reasoning can be cast as max-sum-product problems, a hard class of combinatorial problems. We describe our results in obtaining a new approximation scheme for the problem, that can be turned into an anytime procedure. For many tasks, this scheme can be shown to be asymptotically the best possible heuristic.

PDF IJCAI Semantic Scholar

Cite

Text

Mauá. "Approximation Algorithms for Max-Sum-Product Problems." International Joint Conference on Artificial Intelligence, 2013.

Markdown

[Mauá. "Approximation Algorithms for Max-Sum-Product Problems." International Joint Conference on Artificial Intelligence, 2013.](https://mlanthology.org/ijcai/2013/maua2013ijcai-approximation/)

BibTeX

@inproceedings{maua2013ijcai-approximation,
  title     = {{Approximation Algorithms for Max-Sum-Product Problems}},
  author    = {Mauá, Denis Deratani},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2013},
  pages     = {3235-3236},
  url       = {https://mlanthology.org/ijcai/2013/maua2013ijcai-approximation/}
}