✦ LIBER ✦

Improved Approximation Algorithm for Convex Recoloring of Trees

✍ Scribed by Reuven Bar-Yehuda; Ido Feldman; Dror Rawitz

Publisher: Springer
Year: 2007
Tongue: English
Weight: 460 KB
Volume: 43
Category: Article
ISSN: 1433-0490
DOI: 10.1007/s00224-007-9069-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Quadratic Kernelization for Convex Recol

Quadratic Kernelization for Convex Recoloring of Trees

✍ Hans L. Bodlaender; Michael R. Fellows; Michael A. Langston; Mark A. Ragan; Fran 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 928 KB

Improved Approximation Algorithms for Tr

Improved Approximation Algorithms for Tree Alignment

✍ Lusheng Wang; Dan Gusfield 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 251 KB

Multiple sequence alignment is a task at the heart of much of current computaw x tional biology 4 . Several different objective functions have been proposed to formalize the task of multiple sequence alignment, but efficient algorithms are lacking in each case. Thus multiple sequence alignment is on

An Improved Approximation Algorithm for

An Improved Approximation Algorithm for Multicastk-Tree Routing

✍ Guohui Lin 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 553 KB

The Polya algorithm for convex approxima

The Polya algorithm for convex approximation

✍ David A. Legg; Douglas W. Townsend 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 582 KB

Improved Approximation Algorithms for th

Improved Approximation Algorithms for the Quality of Service Multicast Tree Problem

✍ Marek Karpinski; Ion I. Mandoiu; Alexander Olshevsky; Alexander Zelikovsky 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 175 KB

An improved algorithm for intersecting c

An improved algorithm for intersecting convex polygons

✍ Youssef G. Saab 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 200 KB

A modification of a linear-time algorithm to compute the intersection of two convex polygons reduces the number of computational steps by almost half. @ 1997 Elsevier Science B.V.