Sciweavers

Share
TCS
2011

The three column Bandpass problem is solvable in linear time

8 years 5 months ago
The three column Bandpass problem is solvable in linear time
The general Bandpass problem is NP-hard and was claimed NP-hard when the number of columns is three. Previously we designed a polynomial time row-stacking algorithm for the three column case, to produce a solution that is at most 1 less than the optimum. We show in this paper that for any bandpass number B ≥ 2, an optimal solution is always achievable in linear time.
Zhong Li, Guohui Lin
Added 15 May 2011
Updated 15 May 2011
Type Journal
Year 2011
Where TCS
Authors Zhong Li, Guohui Lin
Comments (0)
books