algorithm with an absolute worst-case ratio less than 2, unless P=NP. We then give a polynomial-time approximation algorithm … with an absolute worst-case ratio exactly 2. Moreover, we give a polynomial-time approximation algorithm with asymptotic … worst-case ratio no more than 3/2. Finally, we perform a computational experiment and show that our approximation algorithm …

pseudo-polynomial time dynamic programming is proposed. We also show that the worst-case ratio of SPT is at most 2.608 and at … least 2.5366 when m is sufficiently large. We further present another algorithm which has a worst-case ratio of 2. …

constraint. We show that our heuristic has a worst-case ratio bound of 4/3 and the bound is tight. …

In this paper we derive the worst-case ratio of an online algorithm for the Traveling Salesman Problem (TSP) with two … online algorithm for this problem restricted to the positive real number line. We then derive the worst-case ratio of our …