Polynomial $(2\alpha +\epsilon )$- and Quadratic $4$-Approximation Algorithms for the Biased Traveling Salesman Problem in Bipartitioned Networks

Jingyang Zhao, Trung Q. Duong, Een-Kee Hong +1

The traveling salesman problem (TSP) is one of the fundamental problems in combinatorial optimization that asks for a minimum-cost Hamiltonian cycle in a complete undirected graph…