Approximation Algorithms for Max-Sum-Product Problems

Denis Deratani Mauá

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.
BibTeX
@inproceedings{maua2013approximation,
  author = {Denis Deratani Mauá},
  title = {{Approximation Algorithms for Max-Sum-Product Problems}},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year = {2013},
}

Loading related content...

Figure