𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Improved Approximations for Tour and Tree Covers

✍ Scribed by Jochen Könemann; Goran Konjevod; Ojas Parekh; Amitabh Sinha

Publisher
Springer
Year
2003
Tongue
English
Weight
170 KB
Volume
38
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Improved Bandwidth Approximation for Tre
Improved Bandwidth Approximation for Trees and Chordal Graphs
✍ Anupam Gupta 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 110 KB

A linear arrangement of an n-vertex graph G = V E is a one-one mapping f of the vertex set V onto the set n = 0 1 n -1 . The bandwidth of this linear arrangement is the maximum difference between the images of the endpoints of any edge in E G . When the input graph G is a tree, the best known approx