A 0.5358-approximation for Bandpass-2

Liqin Huang (), Weitian Tong (), Randy Goebel (), Tian Liu () and Guohui Lin ()
Additional contact information
Liqin Huang: Fuzhou University
Weitian Tong: University of Alberta
Randy Goebel: University of Alberta
Tian Liu: Peking University
Guohui Lin: University of Alberta

Journal of Combinatorial Optimization, 2015, vol. 30, issue 3, No 13, 612-626

Abstract: 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 $$\frac{227}{426}.$$ 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 $$\frac{70-\sqrt{2}}{128}\approx 0.5358$$ 70 - 2 128 ≈ 0.5358 -approximation algorithm for the Bandpass-2 problem.

Keywords: The Bandpass problem; Maximum weight $$b$$ b -matching; Acyclic 2-matching; Approximation algorithm; Worst case performance ratio (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-013-9656-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:30:y:2015:i:3:d:10.1007_s10878-013-9656-2

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-013-9656-2

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().