✦ LIBER ✦

Approximation algorithms for multiple terminal, Hamiltonian path problems

✍ Scribed by Jungyun Bae; Sivakumar Rathinam

Book ID: 107403340
Publisher: Springer-Verlag
Year: 2010
Tongue: English
Weight: 584 KB
Volume: 6
Category: Article
ISSN: 1862-4472
DOI: 10.1007/s11590-010-0252-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A successful algorithm for solving direc

A successful algorithm for solving directed Hamiltonian path problems

✍ Gerald L. Thompson; Sharad Singhal 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 473 KB

Inclusion and exclusion algorithm for th

Inclusion and exclusion algorithm for the Hamiltonian path problem

✍ Eric T. Bax 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 452 KB

A successful algorithm for the undirecte

A successful algorithm for the undirected Hamiltonian path problem

✍ Gerald L. Thompson; Sharad Singhal 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 1010 KB

Approximation Algorithms for Dispersion

Approximation Algorithms for Dispersion Problems

✍ Barun Chandra; Magnús M Halldórsson 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 182 KB

An Approximation Algorithm for the Minim

An Approximation Algorithm for the Minimum Co-Path Set Problem

✍ Zhi-Zhong Chen; Guohui Lin; Lusheng Wang 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 590 KB

Approximation algorithms for multiple se

Approximation algorithms for multiple sequence alignment

✍ Vineet Bafna; Eugene L. Lawler; Pavel A. Pevzner 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 793 KB

We consider the problem of aligning of k sequences of length n. The cost function is sum of pairs, and satisfies triangle inequality. Earlier results on finding approximation algorithms for this problem are due to Gusfield (1991) who achieved an approximation ratio of 2 -2/k, and Pevzner (1992) who