Locating a Point of Minimum Variance on Triangular Graphs

Rex K. Kincaid and Oded Z. Maimon
Additional contact information
Rex K. Kincaid: College of William and Mary, Williamsburg, Virginia
Oded Z. Maimon: Tel Aviv University, Israel

Transportation Science, 1989, vol. 23, issue 3, 216-219

Abstract: In this note the convexity of the variance measure for triangular graphs is established, and an expression for the point that minimizes the variance on an edge is given. A transformation of triangular graphs into trees provides an efficient means to implement these properties via a postorder search of a tree. The result is a linear time algorithm that determines a point of minimum variance for any triangular graph whose edge lengths satisfy the triangle inequality.

Date: 1989
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.23.3.216 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:23:y:1989:i:3:p:216-219

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().