### Table 1. Brief history of macromolecular Rraphics

"... In PAGE 4: ... To this point, all available display terminals (with the exception of the BRAD system) were monochromatic and very expensive. At the American Crystallographic Association meeting in Ottawa in 1971,12 Syntex Analytical demonstrated a novel 3D color (512 X 512) raster display with ingenious use of 4,096 words of CPU memory (Data General Nova with a blazing 1-ms cycle time) and a disc with eight read heads, which could store programs, atomic information, and two complete, two-color stereo images, years before color raster graphics became commercially available ( Table1 ). This prototype (Willoughby et al.... ..."

### TABLE II 3D ROUTING FOR ALL TYPES OF NETS. WE COMPARE 3D MAZE ROUTER AND OUR 3D STEINER ROUTER. THE RUNTIME IS IN SECONDS. THE VIA BOUND COLUMN SHOWS A LOWER BOUND ON THE VIA COUNT. 3D Maze Routing 3D A-tree 3D Steiner Routing

### 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 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 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 13. Computational results for Steiner #5CD quot; tree problems

1997

"... In PAGE 8: ... EDPL apos;s advantage diminishes with increasing numbers of unsatis#0Ced clauses #28for example the series of problems in Tables 5#7B7#29; however, even here, EDPL performs better. We also examine the Steiner #5CD quot; weighted tree problems #5B22#5D #28see Table13 #29. Our current implementation of the primal heuristic is too primitive to handle these large variable problems well.... ..."

Cited by 12

### 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.... ..."