Consecutive block minimization is 1.5-approximable

Authors:
Salim Haddadi;Zoubir Layouni
Affiliations:
University of the 8th of May, 1945, Computer Science Department, 24000 Guelma, Algeria;Badji Mokhtar University, Computer Science Department, 23000 Annaba, Algeria
Venue:
Information Processing Letters
Year:
2008

Citing 6
Cited 1

On the consecutive ones property

Discrete Applied Mathematics - Special volume on computational molecular biology DAM-CMB series volume 2
On the hardness of approximating minimization problems

Journal of the ACM (JACM)
Consecutive retrieval property-revisited

Information Processing Letters
PC trees and circular-ones arrangements

Theoretical Computer Science - Computing and combinatorics
PQ-tree algorithms.

PQ-tree algorithms.
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Journal of Computer and System Sciences

Consecutive ones property and PQ-trees for multisets: Hardness of counting their orderings

Information and Computation

Quantified Score

Hi-index	0.89

Visualization

Abstract

We present a polynomial-time heuristic for the Consecutive Block Minimization Problem such that the solutions generated do not differ from optimal by more than 50%.