Abstract
The general Bandpass-B problem is NP-hard and can be approximated by a reduction into the B-set packing problem, with a worst case performance ratio of O(B 2). When B = 2, a maximum weight matching gives a 2-approximation to the problem. The Bandpass-2 problem, or simply 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 in this paper a \(\frac{36}{19}\)-approximation algorithm for the Bandpass problem, which is the first improvement over the simple maximum weight matching based 2-approximation algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arkin, E.M., Hassin, R.: On local search for weighted packing problems. Mathematics of Operations Research 23, 640–648 (1998)
Babayev, D.A., Bell, G.I., Nuriyev, U.G.: The bandpass problem: combinatorial optimization and library of problems. Journal of Combinatorial Optimization 18, 151–172 (2009)
Bell, G.I., Babayev, D.A.: Bandpass problem. In: Annual INFORMS Meeting, Denver, CO, USA (October 2004)
Chandra, B., Halldórsson, M.M.: Greedy local improvement and weighted set packing approximation. In: ACM-SIAM Proceedings of the Tenth Annual Symposium on Discrete Algorithms (SODA 1999), pp. 169–176 (1999)
Chen, Z.-Z., Okamoto, Y., Wang, L.: Improved deterministic approximation algorithms for Max TSP. Information Processing Letters 95, 333–342 (2005)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. W. H. Freeman and Company, San Francisco (1979)
Hassin, R., Rubinstein, S.: Better approximations for Max TSP. Information Processing Letters 75, 181–186 (2000)
Lin, G.: On the Bandpass problem. Journal of Combinatorial Optimization 22, 71–77 (2011)
Paluch, K., Mucha, M., Mądry, A.: A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) APPROX 2009. LNCS, vol. 5687, pp. 298–311. Springer, Heidelberg (2009)
Serdyukov, A.I.: An algorithms for with an estimate for the traveling salesman problem of the maximum. Upravlyaemye Sistemy 25, 80–86 (1984)
Vizing, V.G.: On an estimate of the chromatic class of a p-graph. Diskretnogo Analiza 3, 25–30 (1964)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tong, W., Goebel, R., Ding, W., Lin, G. (2012). An Improved Approximation Algorithm for the Bandpass Problem. In: Snoeyink, J., Lu, P., Su, K., Wang, L. (eds) Frontiers in Algorithmics and Algorithmic Aspects in Information and Management. Lecture Notes in Computer Science, vol 7285. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29700-7_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-29700-7_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29699-4
Online ISBN: 978-3-642-29700-7
eBook Packages: Computer ScienceComputer Science (R0)