Computer Science: Faculty Publications
A 0.5358-Approximation for Bandpass-2
Document Type
Article
Publication Date
10-2015
Publication Title
Journal of Combinatorial Optimization
DOI
10.1007/s10878-013-9656-2
ISSN
1573-2886
Abstract
The Bandpass-2 problem is a variant of the maximum traveling salesman problem arising from optical communication networks using wavelength-division multiplexing technology, in which the edge weights are dynamic rather than fixed. The previously best approximation algorithm for this NP-hard problem has a worst-case performance ratio of 227/426. Here we present a novel scheme to partition the edge set of a 4-matching into a number of subsets, such that the union of each of them and a given matching is an acyclic 2-matching. Such a partition result takes advantage of a known structural property of the optimal solution, leading to a 70−2√/128≈0.5358-approximation algorithm for the Bandpass-2 problem.
Recommended Citation
Huang, Liqin, Weitian Tong, Randy Goebel, Tian Liu, Guohui Lin.
2015.
"A 0.5358-Approximation for Bandpass-2."
Journal of Combinatorial Optimization, 30 (3): 612-626.
doi: 10.1007/s10878-013-9656-2
https://digitalcommons.georgiasouthern.edu/compsci-facpubs/65
Copyright
This work is archived and distributed under the repository's Standard Copyright and Reuse License (opens in new tab). End users may copy, store, and distribute this work without restriction. For all other uses, permission must be obtained from the copyright owners or their authorized agents.
