๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Improved Approximation Algorithms for Data Migration

โœ Scribed by Samir Khuller; Yoo-Ah Kim; Azarakhsh Malekian

Book ID
106149220
Publisher
Springer
Year
2011
Tongue
English
Weight
576 KB
Volume
63
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Algorithms for Data Migration
Algorithms for Data Migration
โœ E. Anderson; J. Hall; J. Hartline; M. Hobbes; A. Karlin; J. Saia; R. Swaminathan ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Springer ๐ŸŒ English โš– 737 KB
Improved Approximation Algorithms for MA
Improved Approximation Algorithms for MAX SAT
โœ Takao Asano; David P. Williamson ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 215 KB

MAX SAT (the maximum s~tisfiability problem) is stated as follows: given a set of clauses with weights, find a truth assignment that maximizes the sum of the weights of the satisfied clauses. In this paper, we consider approxima~ tion algorithms for MAX SAT proposed by Goemans and Williamson and pze

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