Approximation Algorithms for Max-Sum-Product Problems

Mauá, Denis Deratani

Approximation Algorithms for Max-Sum-Product Problems

Download BibTeX Cite

Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence. Pages 3235-3235.

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.

Denis Deratani Mauá. 2013. Approximation Algorithms for Max-Sum-Product Problems. In Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, IJCAI-13. IJCAI, 3235–3235. https://ijcai.org/proceedings/2013/504

@inproceedings{ijcai2013p504,
  title     = {Approximation Algorithms for Max-Sum-Product Problems},
  author    = {Mauá, Denis Deratani},
  booktitle = {Proceedings of the Twenty-Third International Joint Conference on
               Artificial Intelligence, {IJCAI-13}},
  publisher = {AAAI Press / International Joint Conferences on Artificial Intelligence},
  editor    = {Francesca Rossi},
  pages     = {3235--3235},
  year      = {2013},
  month     = {8},
  url       = {https://ijcai.org/proceedings/2013/504},
}

TY  - CPAPER
TI  - Approximation Algorithms for Max-Sum-Product Problems
AU  - Mauá, Denis Deratani
T2  - Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, IJCAI-13
PB  - AAAI Press / International Joint Conferences on Artificial Intelligence
PY  - 2013
SP  - 3235
EP  - 3235
UR  - https://ijcai.org/proceedings/2013/504
ER  -