A constrained minimum spanning tree problem

0.00 Avg rating—0 Votes

Article ID:	iaor20011467
Country:	United Kingdom
Volume:	27
Issue:	9
Start Page Number:	867
End Page Number:	875
Publication Date:	Aug 2000
Journal:	Computers and Operations Research
Authors:	Zhang Guochuan, Chen Guangting
Keywords:	combinatorial analysis

Abstract:

In this paper, we give an O(n²) algorithm for finding a point on a given line l which, if added to a given set of n points located on one side of l, will result in the minimum spanning tree.

Reviews

Required fields are marked *. Your email address will not be published.