✦ LIBER ✦

Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference

✍ Scribed by Bar-Yehuda, Reuven; Geiger, Dan; Naor, Joseph (Seffi); Roth, Ron M.

Book ID: 118177494
Publisher: Society for Industrial and Applied Mathematics
Year: 1998
Tongue: English
Weight: 324 KB
Volume: 27
Category: Article
ISSN: 0097-5397
DOI: 10.1137/s0097539796305109

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An exact algorithm for the constraint sa

An exact algorithm for the constraint satisfaction problem: Application to logical inference

✍ Hachemi Bennaceur; Gérard Plateau 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 590 KB

Approximation Algorithms for the Mobile

Approximation Algorithms for the Mobile Piercing Set Problem with Applications to Clustering in Ad-Hoc Networks

✍ Hai Huang; Andréa W. Richa; Michael Segal 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 182 KB

Optimization of Pearl‘s method of condit

Optimization of Pearl‘s method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem : A. Becker and D. Geiger

📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 78 KB

Forthcoming Papers ## A. Becker and D. Geiger, Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem We show how to find a small loop curser in a Bayesian network. Finding such a loop cutset is the first step in the method of c