An approximation algorithm for the Bandpass-2 problem
Data Structures and Algorithms
2013-07-29 v1
Abstract
The general Bandpass- problem is NP-hard and can be approximated by a reduction into the weighted -set packing problem, with a worst case performance ratio of . When , a maximum weight matching gives a 2-approximation to the problem. In this paper, we call the Bandpass-2 problem simply the Bandpass problem. The Bandpass problem can be viewed as a variation of the maximum traveling salesman problem, in which the edge weights are dynamic rather than given at the front. We present a -approximation algorithm for the problem. Such an improved approximation is built on an intrinsic structural property proven for the optimal solution and several novel schemes to partition a -matching into desired matchings.
Cite
@article{arxiv.1307.7089,
title = {An approximation algorithm for the Bandpass-2 problem},
author = {Weitian Tong and Zhi-Zhong Chen and Lusheng Wang and Yinfeng Xu and Jiuping Xu and Randy Goebel and Guohui Lin},
journal= {arXiv preprint arXiv:1307.7089},
year = {2013}
}