On the Exact Block Cover Problem

ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, AAIM 2014, pp. 13-22, 2014.

Cited by: 5|Views8
EI

Abstract:

Minimum Common String Partition (MCSP) has drawn a lot of attention due to its application in genome rearrangement. The best approximation algorithm has a factor O(log n log* n) and it was shown most recently that it is FPT (but with a very high running time). In this paper, we consider the decision version of the one-sided MCSP problem (...More

Code:

Data:

Get fulltext within 24h
Bibtex
Your rating :
0

 

Tags
Comments