The asymmetric maximum travelling salesman problem, also known as the Taxicab Ripoff problem, is the problem of finding a maximally weighted tour in a complete asymmetric graph with non-negative weights. Interesting in its own right, this problem is also motivated by such problems such as the shortest superstring problem.We propose a polynomial time approximation algorithm for the problem with a 5/8 approximation guarantee. This (1) improves upon the approximation factors of previous results and (2) presents a simpler solution to the previously fairly involved algorithms. Our solution uses a simple LP formulation. Previous solutions where combinatorial. We make use of the LP in a novel manner and strengthen the Path-Coloring method originally proposed in [13].
展开▼
机译：非对称网球拍或其他球拍-球拍的中线纵轴的每一侧都有不同宽度的拍头，且球拍的厚度不同。AB FR2691073A该球拍的手柄（4）沿球头的中纵轴排列。轴将头部分为左右两部分（7,8）。在垂直于轴线的每个侧向平面中，左侧部分（8）比右侧部分（7）宽。磁头左侧的最大厚度（L2）大于右侧的最小厚度（L3）。最大厚度大于手柄的厚度（L1），最小厚度小于此值。框架的左侧比右侧更厚。用途/优势-用于网球和类似运动的不对称球拍有利于将热量与地面成直角放置。 AN 93407774 TI内置磁罗经的滑雪杖-包括空心金属管（续）。带有塞子的指南针，用于覆盖wri附近的顶部开口
