Abstract
The complexity of the Bandpass problem is re-investigated. Specifically, we show that the problem with any fixed bandpass number B≥2 is NP-hard. Next, a row stacking algorithm is proposed for the problem with three columns, which produces a solution that is at most 1 less than the optimum. For the special case B=2, the row stacking algorithm guarantees an optimal solution. On approximation, for the general problem, we present an O(B 2)-algorithm, which reduces to a 2-approximation algorithm for the special case B=2.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Arkin EM, Hassin R (1998) On local search for weighted packing problems. Math Oper Res 23:640–648
Babayev DA, Bell GI, Nuriyev UG (2009) The bandpass problem: combinatorial optimization and library of problems. J Comb Optim 18:151–172
Bell GI, Babayev DA (2004) Bandpass problem. In: Annual INFORMS meeting, October 2004, Denver, CO, USA
Chandra B, Halldórsson MM (1999) Greedy local improvement and weighted set packing approximation. In: ACM-SIAM proceedings of the tenth annual symposium on discrete algorithms (SODA’99), pp 169–176
Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Lin, G. On the Bandpass problem. J Comb Optim 22, 71–77 (2011). https://doi.org/10.1007/s10878-009-9273-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-009-9273-2