{"_id":"WnxKG2F3rrdTXAtz7","bibbaseid":"becker-geiger-asufficientlyfastalgorithmforfindingclosetooptimaljunctiontrees","downloads":0,"creationDate":"2017-04-19T15:50:25.075Z","title":"A sufficiently fast algorithm for finding close to optimal junction trees","author_short":["Becker, A.","Geiger, D."],"year":null,"bibtype":"inproceedings","biburl":"http://www.ia.uned.es/~mluque/cisiad.bib","bibdata":{"bibtype":"inproceedings","type":"inproceedings","title":"A sufficiently fast algorithm for finding close to optimal junction trees","author":[{"propositions":[],"lastnames":["Becker"],"firstnames":["A."],"suffixes":[]},{"propositions":[],"lastnames":["Geiger"],"firstnames":["D."],"suffixes":[]}],"pages":"81-89","crossref":"uai1996","bibtex":"@InProceedings{becker1996,\n Title = {A sufficiently fast algorithm for finding close to optimal junction trees},\n Author = {Becker, A. and Geiger, D.},\n Pages = {81-89},\n\n Crossref = {uai1996}\n}\n\n","author_short":["Becker, A.","Geiger, D."],"key":"becker1996","id":"becker1996","bibbaseid":"becker-geiger-asufficientlyfastalgorithmforfindingclosetooptimaljunctiontrees","role":"author","urls":{},"downloads":0},"search_terms":["sufficiently","fast","algorithm","finding","close","optimal","junction","trees","becker","geiger"],"keywords":[],"authorIDs":[],"dataSources":["M66iSiMeC2pAhHPfr"]}