#### Filter Results:

- Full text PDF available (1)

#### Publication Year

1993

2003

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

This paper gives the average distance analysis for the Euclidean tree constructed by a simple greedy but efficient algorithm of the on-line Steiner tree problem. The algorithm accepts the data one by one following the order of input sequence. When a point arrives, the algorithm adds the shortest edge, between the new point and the points arriving already,… (More)

- Ying Teh Tsai, Chuan Yi Tang
- Inf. Process. Lett.
- 1993

- Ying Teh Tsai, Chuan Yi Tang
- CATS
- 1998

- ‹
- 1
- ›