| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428207 | Information Processing Letters | 2008 | 4 Pages |
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%.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
