### Table 1. The competitive ratio of symmetric and asymmetric routing problems.

2005

"... In PAGE 2: ... Previous work, both theoretical and experimental, has focused on the off-line version [7,10,13]. Our results are summarized in Table1 , where they are also compared with the known results for the symmetric case. As we will see, the asymmetric TSP is substantially harder than the normal TSP even when considered from an on-line point of view; in other words, OL-ATSP is not a trivial extension of OL-TSP.... In PAGE 2: ... As we will see, the asymmetric TSP is substantially harder than the normal TSP even when considered from an on-line point of view; in other words, OL-ATSP is not a trivial extension of OL-TSP. In fact, as Table1 shows, most bounds on the competitive ratio are strictly higher than the corresponding bounds for OL-TSP, and in particular in the nomadic case there cannot be on-line algorithms with a constant competitive ratio. Although our algorithms come essentially from the symmetric case, they require some adjustment in order to attain useful competitive ratios.... ..."

Cited by 5

### Table 1: A comparison of the optimal randomized and deterministic strategy to search on m rays.

"... In PAGE 13: ... 4 The Asymptotic Competitive Ratio In this section we investigate the growth rate of the competitive ratio for randomized search strategies on m rays. As Table1 shows it seems that the competitive ratio grows linearly with the number of rays. In the following we are going to compute the exact constant of proportionality.... ..."

### Table 1. Greedy competitive ratio (general cost)

"... In PAGE 4: ... The first set of our results deals with the competitive ratio of the Greedy Policy with regards to the global QoS metric, that is the sum of the costs of all the dis- carded frames under a well-behaved cost function. Our main result is presented in Table1 : for any sequence of frames, the competitive ratio of the Greedy Policy is... ..."

### Table 1 Best competitive ratios for UNIFORM

1992

"... In PAGE 6: ...his completes the proof of Theorem 3.1. Given a value of D, we can choose k to minimize the maximum of 1 + k+1 2D and 1 + 1 k ?2D + k+12 . Table1 shows the best competitive ratio for UNIFORM for values of D up to 10. These values are found by setting 1 + k + 1 2D = 1 + 1 k 2D + k + 1 2 and solving for k in terms of D.... ..."

Cited by 26

### Table 1: Competitive ratio of L-greedy

"... In PAGE 4: ... For many such systems including net- worked reprographic machines, a theoretical model which does not incorporate lookahead runs the risk of being inapplicable to the real problem. More speci cally, we derive fairly tight results on the L-greedy, a natural greedy algo- rithm with lookahead L ( Table1 ). The term ML-greedy represents the competitive ratio of L-greedy with respect to the makespan performance metric which we de ne formally in Section 1.... ..."

### Table 1: Bounds on the competitive ratio x implied

1995

"... In PAGE 8: ... 2 To get more detailed information on the best bound on x implied by #286#29, we consider the corresponding recurrence x = cp + p #20 p,1 lnc +1 x ! p,1 ; #287#29 for all c#3E1. Table1 shows the bounds on the com- petitive ratio x implied by #286#29, where the choice of c is optimized for each p. As p gets larger, the optimal value of c for use in #287#29 converges to the solution of the equation c ln c = 1, whichisc#191:77.... ..."

Cited by 22

### TABLE 1. Competitive ratios for the problems OLTRP and OLLDARP.

2001

Cited by 11

### TABLE 1. Competitive ratios for the problems OLTRP and OLLDARP.

2001

Cited by 11

### TABLE I COMPETITIVE RATIOS OF GREEDY FORWARDING

2005

Cited by 8

### Table 2. Competitive ratios given in this paper.

2005

Cited by 6