Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
— This paper presents a comparative analysis relative to the experimental performances of an asymptotically fast and incremental algorithm, recently developed to compute collisio...
We present approximation and online algorithms for a number of problems of pricing items for sale so as to maximize seller’s revenue in an unlimited supply setting. Our first r...
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Ha...
This paper presents an algorithm for fast sorting of large lists using modern GPUs. The method achieves high speed by efficiently utilizing the parallelism of the GPU throughout th...