An improved approximation algorithm for the bandpass problem

Authors:
Weitian Tong;Randy Goebel;Wei Ding;Guohui Lin
Affiliations:
Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada;Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada;Zhejiang Water Conservancy and Hydropower College, Hangzhou, Zhejiang, China;Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada
Venue:
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
Year:
2012

Citing 7
Cited 0

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
Better approximations for max TSP

Information Processing Letters
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem

APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Improved deterministic approximation algorithms for Max TSP

Information Processing Letters
On the Bandpass problem

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

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.