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.

Link to Full Text

Share

COinS