✦ LIBER ✦

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

✍ Scribed by V.Th. Paschos

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 221 KB
Volume: 44
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(92)90248-t

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An approximation algorithm for the maxim

An approximation algorithm for the maximum independent set problem in cubic planar graphs

✍ Elarbi Choukhmane; John Franco 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 289 KB 👁 1 views

The maximum independent set problem for

The maximum independent set problem for cubic planar graphs

✍ James E. Burns 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 286 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

The struction algorithm for the maximum

The struction algorithm for the maximum stable set problem revisited

✍ K.W. Hoke; M.F. Troyon 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 491 KB

Algorithms for a maximum clique and a ma

Algorithms for a maximum clique and a maximum independent set of a circle graph

✍ F. Gavril 📂 Article 📅 1973 🏛 John Wiley and Sons 🌐 English ⚖ 523 KB

## Abstract Consider a family of chords in a circle. A circle graph is obtained by representing each chord by a vertex, two vertices being connected by an edge when the corresponding chords intersect. In this paper, we describe efficient algorithms for finding a maximum clique and a maximum indepen

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