Title of article :
A constrained minimum spanning tree problem
Author/Authors :
Guangting Chen، نويسنده , , Guochuan Zhang، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 2000
Abstract :
In this paper, we give an O(n2) 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.
Keywords :
Spanning tree , Divide-and-conquer , Algorithm
Journal title :
Computers and Operations Research
Journal title :
Computers and Operations Research
