✦ LIBER ✦

Efficient approximation algorithms for the achromatic number

✍ Scribed by Piotr Krysta; Krzysztof Loryś

Book ID: 108281205
Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 357 KB
Volume: 361
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2006.05.007

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximation Algorithms for the Achroma

Approximation Algorithms for the Achromatic Number

✍ Amitabh Chaudhary; Sundar Vishwanathan 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 108 KB

The achromatic number for a graph G = V E is the largest integer m such that there is a partition of V into disjoint independent sets V 1 V m such that for each pair of distinct sets V i , V j , V i ∪ V j is not an independent set in G. Yannakakis and Gavril (1980, SIAM J. Appl. Math. 38, 364-372) p

On Approximating the Achromatic Number

✍ Kortsarz, Guy; Krauthgamer, Robert 📂 Article 📅 2001 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 206 KB

An Improved Approximation of the Achroma

An Improved Approximation of the Achromatic Number on Bipartite Graphs

✍ Kortsarz, Guy; Shende, Sunil 📂 Article 📅 2007 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 190 KB

Volume 41, Number 2 (2001), in the artic

Volume 41, Number 2 (2001), in the article “Approximation Algorithms for the Achromatic Number,” by Amitabh Chaudhary and Sundar Vishwanathan, pages 404–416 ()

📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 19 KB

Efficient approximation algorithms for c

Efficient approximation algorithms for clustering point-sets

✍ Guang Xu; Jinhui Xu 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 279 KB

Approximation Algorithms for the Fixed-T

Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem

✍ M. Cryan L. A. Goldberg; C. A. Phillips 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 141 KB