### Table 1: Geodetic, monophonic, hull and Steiner number of some classes of graphs.

### Table 1. Experimental results, with r =32for the uniformly sampled hull, r =16for the adaptive and partially adaptive hulls, and 0 =2 =r = =8.\Partial quot; refers to the partially adaptive scheme.

2004

"... In PAGE 10: ... Our adaptive hull was never much worse than the uniformly sampled hull, and usually much better. The rst line of Table1 shows results for points chosen from a disk. The uniformly sampled hull is ideal for this dis- tribution, and indeed our algorithm is 25% worse in worst- case error and 10% worse in number of points outside the approximate hull.... ..."

Cited by 10

### Table 1. Experimental results, with r =32for the uniformly sampled hull, r =16for the adaptive and partially adaptive hulls, and 0 =2 =r = =8.\Partial quot; refers to the partially adaptive scheme.

2004

"... In PAGE 10: ... Our adaptive hull was never much worse than the uniformly sampled hull, and usually much better. The rst line of Table1 shows results for points chosen from a disk. The uniformly sampled hull is ideal for this dis- tribution, and indeed our algorithm is 25% worse in worst- case error and 10% worse in number of points outside the approximate hull.... ..."

Cited by 10

### Table 1: Steiner tree approximation algorithms

1999

"... In PAGE 1: ... But only few of them have prov- ably good performance ratios. Table1 gives a survey on such results. (The algorithm of Promel and Steger [11] is a randomized algorithm, all other algorithms listed in the table are deterministic algorithms.... In PAGE 2: ... This idea naturally extends to adding shortest connections between k-tuples of terminals, for xed k. All approximation algorithms for the Steiner tree prob- lem listed in Table1 are based on this simple idea. The present approach to get better performance ratios for the Steiner tree problem in graphs is to iteratively apply a series of algorithms to the output of its predecessor.... ..."

Cited by 21

### Table 1: Steiner tree approximation algorithms

1999

"... In PAGE 1: ... But only few of them have prov- ably good performance ratios. Table1 gives a survey on such results. (The algorithm of Promel and Steger [11] is a randomized algorithm, all other algorithms listed in the table are deterministic algorithms.... In PAGE 2: ... This idea naturally extends to adding shortest connections between k-tuples of terminals, for xed k. All approximation algorithms for the Steiner tree prob- lem listed in Table1 are based on this simple idea. The present approach to get better performance ratios for the Steiner tree problem in graphs is to iteratively apply a series of algorithms to the output of its predecessor.... ..."

Cited by 21

### Table 1: Comparison between Geo-Steiner, FastSteiner, 1-cktSteiner, FLUTE and B-cktSteiner.

2006

"... In PAGE 4: ... Therefore, we use a 4X finer grid in all experiments below. Table1 presents experiments for obstacle-free routing. We first compare 1-cktSteiner with the exact solution of GeoSteiner [1], and FastSteiner which generates the shortest wirelength among existing heuristics.... In PAGE 4: ...verage 5.2X faster (11.3X faster for the largest example) than FastSteiner, which in turn is on average 208X faster than GeoSteiner. Table1 also compares B-cktSteiner with FLUTE [6], the fastest algorithm among existing heuristics. B-cktSteiner achieves up to 1.... ..."

Cited by 2

### Table 2: Octilinear Steiner Tree Results # Edge-Based Batched Isomo.

"... In PAGE 3: ...201 3.618 For first set of data, we randomly generated 100 nets for each terminals set, range from 10 terminals to 10,000 termi- nals, as shown in Table 1 and Table2 . The terminals are drawn uniformly at random from a 20,000 by 20,000 grid for each net.... In PAGE 4: ...019% in the second column on Table 1. We also compare our algorithm with two other octilin- ear Steiner tree algorithms in Table2 . The improving per- centage column for each algorithm is comparing a octilinear MST to its octilinear Steiner tree by using the same formula in the last column of Table 1.... ..."

### Table 2: The orientation change algorithm. The term randmrefers to a function which would produce a uniformly distributed random number between 0 and 1.

2003

"... In PAGE 17: ...fixed array approaches. The algorithm used for orientation control is given in Table2 . It uses the last time delay measurement to determine how to change the orientation of the microphones and whether to make a relatively large or small change.... ..."

Cited by 6