✦ LIBER ✦

Approximating the maximum multiple RNA interaction problem

✍ Scribed by Tong, Weitian; Goebel, Randy; Liu, Tian; Lin, Guohui

Book ID: 122145176
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 442 KB
Volume: 556
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.04.018

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximating the Maximum Internal Spann

Approximating the Maximum Internal Spanning Tree problem

✍ Gábor Salamon 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 933 KB

Approximations for the maximum acyclic s

Approximations for the maximum acyclic subgraph problem

✍ Refael Hassin; Shlomi Rubinstein 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 722 KB

The Maximum Clique Problem in Multiple I

The Maximum Clique Problem in Multiple Interval Graphs

✍ Francis, Mathew C.; Gonçalves, Daniel; Ochem, Pascal 📂 Article 📅 2013 🏛 Springer 🌐 English ⚖ 981 KB

On the approximability of some maximum s

On the approximability of some maximum spanning tree problems

✍ Giulia Galbiati; Angelo Morzenti; Francesco Maffioli 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 844 KB

We study the approximability of some problems which aim at finding spanning trees in undirected graphs which maximize, rather than minimize, a single objective function representing a form of benefit or usefulness of the tree. We prove that the problem of finding a spanning tree which maximizes the

Approximation algorithms for the maximum

Approximation algorithms for the maximum 2-peripatetic salesman problem

✍ Gimadi, E. Kh.; Ivonina, E. V. 📂 Article 📅 2012 🏛 Pleiades Publishing 🌐 English ⚖ 616 KB

Approximate solutions for the maximum be

Approximate solutions for the maximum benefit chinese postman problem

✍ Pearn, W. L.; Chiu, W. C. 📂 Article 📅 2005 🏛 Taylor and Francis Group 🌐 English ⚖ 164 KB