✦ LIBER ✦

Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem

✍ Scribed by M. Cryan L. A. Goldberg; C. A. Phillips

Book ID: 105745731
Publisher: Springer
Year: 1999
Tongue: English
Weight: 141 KB
Volume: 25
Category: Article
ISSN: 0178-4617
DOI: 10.1007/pl00008280

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An approximative algorithm for the fixed

An approximative algorithm for the fixed-charges transportation problem

✍ Harold W. Kuhn; William J. Baumol 📂 Article 📅 1962 🏛 John Wiley and Sons 🌐 English ⚖ 840 KB

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

Efficient approximation algorithms for t

Efficient approximation algorithms for the achromatic number

✍ Piotr Krysta; Krzysztof Loryś 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 357 KB

Approximation and fixed-parameter algori

Approximation and fixed-parameter algorithms for consecutive ones submatrix problems

✍ Michael Dom; Jiong Guo; Rolf Niedermeier 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 505 KB

Approximation Algorithms for the Class C

Approximation Algorithms for the Class Cover Problem

✍ Adam H. Cannon; Lenore J. Cowen 📂 Article 📅 2004 🏛 Springer Netherlands 🌐 English ⚖ 89 KB

Approximation algorithms for the traveli

Approximation algorithms for the traveling salesman problem

✍ Jérôme Monnot; Vangelis Th. Paschos; Sophie Toulouse 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 200 KB