{"type":"ScholarlyArticle","title":"Approximation Algorithms for Max-Sum-Product Problems","authors":[{"name":"Denis Deratani Mauá","slug":"denis-deratani-maua","given":"Denis Deratani","family":"Mauá","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/2013/504","pdf":"https://ijcai.org/proceedings/2013/0504.pdf","markdown":"https://ijcai.org/proceedings/2013/504.md","bibtex":"https://ijcai.org/proceedings/2013/bibtex/504","volume":{"slug":"2013","title":"Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2013","url":"https://ijcai.org/proceedings/2013/","year":2013,"location":"Beijing, China","dates":"3–9 August 2013","editors":"Francesca Rossi","isbn":"978-1-57735-633-2","publisher":"AAAI Press / International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":504,"pages":{"first":3235,"last":3235},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}