[图书][B] Handbook of approximation algorithms and metaheuristics
TF Gonzalez - 2007 - taylorfrancis.com
Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …
DREAM-Yara: an exact read mapper for very large databases with short update time
TH Dadi, E Siragusa, VC Piro, A Andrusch… - …, 2018 - academic.oup.com
Motivation Mapping-based approaches have become limited in their application to very
large sets of references since computing an FM-index for very large databases (eg> 10 GB) …
large sets of references since computing an FM-index for very large databases (eg> 10 GB) …
ganon: precise metagenomics classification against large and up-to-date sets of reference sequences
Motivation The exponential growth of assembled genome sequences greatly benefits
metagenomics studies. However, currently available methods struggle to manage the …
metagenomics studies. However, currently available methods struggle to manage the …
A general approach for incremental approximation and hierarchical clustering
G Lin, C Nagarajan, R Rajaraman… - SIAM Journal on …, 2010 - SIAM
We present a general framework and algorithmic approach for incremental approximation
algorithms. The framework handles cardinality constrained minimization problems, such as …
algorithms. The framework handles cardinality constrained minimization problems, such as …
STeP: Scalable tenant placement for managing database-as-a-service deployments
Public cloud providers with Database-as-a-Service offerings must efficiently allocate
computing resources to each of their customers. An effective assignment of tenants both …
computing resources to each of their customers. An effective assignment of tenants both …
A general approach for incremental approximation and hierarchical clustering
G Lin, C Nagarajan, R Rajaraman… - Proceedings of the …, 2006 - dl.acm.org
We present a general framework and algorithmic approach for incremental approximation
algorithms. The framework handles cardinality constrained minimization problems, such as …
algorithms. The framework handles cardinality constrained minimization problems, such as …
A dynamic tenant-defined storage system for efficient resource management in cloud applications
Abstract Software-Defined Storage (SDS) is an evolving concept for the management of data
storage from the software's perspective. Multi-tenant applications running on the cloud can …
storage from the software's perspective. Multi-tenant applications running on the cloud can …
Variants of Classical One Dimensional Bin Packing
J Csirik, C Imreh - Handbook of approximation algorithms and …, 2018 - taylorfrancis.com
This chapter discusses the variant in which the number of items packed is maximized. It
describes a variant that places a bound on the number of items that can be packed in each …
describes a variant that places a bound on the number of items that can be packed in each …
Incremental algorithms for the maximum internal spanning tree problem
The maximum internal spanning tree (MIST) problem is utilized to determine a spanning tree
in a graph G, with the maximum number of possible internal vertices. The incremental …
in a graph G, with the maximum number of possible internal vertices. The incremental …
Optimal algorithms and approximation algorithms for replica placement with distance constraints in tree networks
A Benoit, H Larchevêque… - 2012 IEEE 26th …, 2012 - ieeexplore.ieee.org
In this paper, we study the problem of replica placement in tree networks subject to server
capacity and distance constraints. The client requests are known beforehand, while the …
capacity and distance constraints. The client requests are known beforehand, while the …