### Table 2: Full Steiner tree generation and pruning.

1997

"... In PAGE 22: ...y Beasley and Go net [6] (Section 5.3). 5.1 Full Steiner Tree Generation and Pruning The performance of the full Steiner tree generation method is summarized in Table2 . The algorithm uses the Gabriel graph to nd subsets containing up to K = 5 terminals and bottleneck Steiner distances to prune FSTs.... ..."

Cited by 4

### 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 I STEINER TREE HEURISTIC STATISTICS

1992

Cited by 96

### Table 2.1: Steiner Tree Heuristics [8]

### Table 8: Two-Pole simulation results comparing CS-Steiner trees with 1-Steiner heuristic trees. Eachentry

in References

"... In PAGE 28: ... Our inputs correspond to the four distinct technologies described in Table 1. Table8 gives delay and tree cost #28WL#29 results and comparisons. The delays at all sink nodes correspond to 50#25 rise times estimated using the Two-Pole simulator #5B37#5D#5B38#5D.... In PAGE 28: ... The delays at all sink nodes correspond to 50#25 rise times estimated using the Two-Pole simulator #5B37#5D#5B38#5D. Eachentry in Table8 represents an average taken over every sink node in 50 random pointsets. We emphasize that the 1-Steiner algorithm #28or the BRBC, AHHK, etc.... ..."

### Table 4: Steiner vs Shortest Paths Trees

2003

"... In PAGE 113: ... The parameters were the same as used in the romrOn case described above. The results, given in Table4 , showed that the successful delivery of packets to the receivers was very similar in both of the two cases, but other statistics gathered indicate the superiority of the use of the Steiner trees. The average amount of time a tree set remained active before a new tree set was distributed was 8% shorter in the shortest paths trees than in the Steiner tree version.... ..."

Cited by 3

### 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 4: Runtime breakdown for FastRoute. Cong Map Steiner Tree Route two-pin nets

"... In PAGE 7: ... Third, we show the runtime breakdown for FastRoute default mode. As shown in Table4 , the three phases in FastRoute: con- gestion map generation, congestion-driven Steiner tree topology construction, and two-pin nets routing account for 14.4%, 27.... ..."