Sequential and Parallel Approximation of Shortest Superstrings

Author： Czumaj A.   Gasieniec L.   Piotrow M.   Rytter W.  

Publisher： Academic Press

ISSN： 0196-6774

Source： Journal of Algorithms, Vol.23, Iss.1, 1997-04, pp. : 74-100

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Parallel Asynchronous Algorithms for the K Shortest Paths Problem

By Guerriero F.   Musmanno R.  

Journal of Optimization Theory and Applications, Vol. 104, Iss. 1, 2000-01 ,pp. : 91-108

Springer Publishing Company

Access to resources Recommend Favorite

Efficient Parallel Shortest-Paths in Digraphs with a Separator Decomposition

By Cohen E.  

Journal of Algorithms, Vol. 21, Iss. 2, 1996-09 ,pp. : 331-357

Academic Press

Access to resources Recommend Favorite

A Randomized Parallel Algorithm for Single-Source Shortest Paths

By Klein P.N.   Subramanian S.  

Journal of Algorithms, Vol. 25, Iss. 2, 1997-11 ,pp. : 205-220

Academic Press

Access to resources Recommend Favorite

Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time

By Baptiste Philippe  

Mathematical Methods of Operations Research, Vol. 60, Iss. 1, 2004-09 ,pp. : 145-153

Springer Publishing Company

Access to resources Recommend Favorite

Optimal Sequential Sampling Policy of Partitioned Random Search and Its Approximation

By Tang Z.B.  

Journal of Optimization Theory and Applications, Vol. 98, Iss. 2, 1998-08 ,pp. : 431-448

Springer Publishing Company

Access to resources Recommend Favorite