Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 30, 1989 - Issue 1-2
Submit an article Journal homepage
18
Views
3
CrossRef citations to date
0
Altmetric
Original Articles

An upper bound for the average length of the euclidean minimum spanning tree

Ning-Yang Baby Wang Institute of Information Science, Academia Sinica Nankang, Taipei, Taiwan, Republic of China
&
Ruei-Chuan Chang Institute of Computer Engineering National Chiao Tung University and Institute of Information Science, Academia Sinica Nankang, Taipei, Taiwan, Republic of China
Pages 1-12 | Received 26 Apr 1988, Accepted 06 May 1988, Published online: 19 Mar 2007

Citations (3)

Keep up to date with the latest research on this topic with citation updates for this article.

Subscribe to citation updates

Read on this site (1)

Ying Teh Tsai, Chuan Yi Tang & Yunn Yen Chen. (1995) Randomized algorithms for the on-line minimum matching problem on euclidean space. International Journal of Computer Mathematics 58:1-2, pages 19-32.
Read now

Articles from other publishers (2)

Ying Teh Tsai, Chuan Yi Tang & Yunn Yen Chen. (1996) An average case analysis of a greedy algorithm for the on-line Steiner tree problem. Computers & Mathematics with Applications 31:11, pages 121-131.
Crossref
Ying The Tsai, Chuan Yi Tang & Yunn Yen Chen. (1994) Average performance of a greedy algorithm for the on-line minimum matching problem on Euclidean space. Information Processing Letters 51:6, pages 275-282.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.