✦ LIBER ✦

Approximating independent set in perturbed graphs

✍ Scribed by Manthey, Bodo; Plociennik, Kai

Book ID: 121987499
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 259 KB
Volume: 161
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2012.06.008

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximating the minimum independent do

Approximating the minimum independent dominating set in perturbed graphs

✍ Tong, Weitian; Goebel, Randy; Lin, Guohui 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 466 KB

Approximating minimum coloring and maxim

Approximating minimum coloring and maximum independent set in dotted interval graphs

✍ Minghui Jiang 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 78 KB

Approximation Algorithms for Independent

Approximation Algorithms for Independent Sets in Map Graphs

✍ Zhi-Zhong Chen 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 172 KB

This paper presents polynomial-time approximation algorithms for the problem of computing a maximum independent set in a given map graph G with or without weights on its vertices. If G is given together with a map, then a ratio of 1 + δ can be achieved by a quadratic-time algorithm for any given con

Approximating edge dominating set in den

Approximating edge dominating set in dense graphs

✍ Richard Schmied; Claus Viehmann 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 260 KB

Approximation algorithms for clique-tran

Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs

✍ Zuosong Liang; Erfang Shan 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 133 KB

On approximating the minimum independent

On approximating the minimum independent dominating set

✍ Robert W. Irving 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 550 KB