-
891
-
892
An approximation result for a duo-processor task scheduling problem.
Argitaratua izan da Information processing letters.Artikulua -
893
-
894
On approximating the memory-Constrained Module Allocation Problem.
Argitaratua izan da Information processing letters.Artikulua -
895
Dynamic suffix tree and two-dimensional texts management.
Argitaratua izan da Information processing letters.Artikulua -
896
An approximation algorithm for clustering graphs with dominating diametral path.
Argitaratua izan da Information processing letters.Artikulua -
897
A faster linear systolic algorithm for recovering a longest common subsequence.
Argitaratua izan da Information processing letters.Artikulua -
898
-
899
A simple semi on-line algorithm for P2
Argitaratua izan da Information processing letters.Artikulua -
900
Algorithms for parsimonious complete sets in directed graphs.
Argitaratua izan da Information processing letters.Artikulua