On Local Search for Weighted K-Set Packing
Mathematics of Operations Research
Greedy local improvement and weighted set packing approximation
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The three column Bandpass problem is solvable in linear time
Theoretical Computer Science
An improved approximation algorithm for the bandpass problem
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Hi-index | 0.00 |
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.