✦ LIBER ✦

A natural model and a parallel algorithm for approximately solving the maximum weighted independent set problem

✍ Scribed by Mohamed Afif; Aristidis Likas; Vangelis Th. Paschos

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 535 KB
Volume: 5
Category: Article
ISSN: 0960-0779
DOI: 10.1016/0960-0779(94)00175-p

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A ( °/2) -approximation algorithm for th

A ( °/2) -approximation algorithm for the maximum independent set problem

✍ V.Th. Paschos 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 221 KB

Sequential and parallel algorithms for t

Sequential and parallel algorithms for the maximum-weight independent set problem on permutation graphs

✍ Ming-Shing Yu; Lin Yu Tseng; Shoe-Jane Chang 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 428 KB

A branch-and-price approach for the maxi

A branch-and-price approach for the maximum weight independent set problem

✍ Deepak Warrier; Wilbert E. Wilhelm; Jeffrey S. Warren; Illya V. Hicks 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 124 KB

A fast and simple randomized parallel al

A fast and simple randomized parallel algorithm for the maximal independent set problem

✍ Noga Alon; László Babai; Alon Itai 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 920 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