It would be greatly appreciated if this announcement could be
shared with individuals whose research interests include
e-learning, e-business, enterprise information systems, and
e-government. Thanks.
---
CALL FOR PAPERS
EEE'10
I am thinkin like.. make a completely connected graph.. (connect all
2N points to each other)... then delete connections starting with ones
with max distance between them... this should give the desired result
On Feb 11, 11:20 pm, GentLeBoY vikrantsing...@gmail.com wrote:
given 2N points in a
We can make a spanning tree for these 2N points and then find the
minimum spanning tree
keeping in mind that a node can only be considered in one edge and not
more than once.
This will give you the minimum total sum of all the pairs.
You can use kruskal's min spanning tree algorithm to find the
@sachin : the problem is bit more complex , consider N be 2 , and
coordinates be (-2,0) (0,0) (1,0) (3,0). your solution( min value=1+5=6)
wont give the right answer(2+2=4).
On Sat, Feb 13, 2010 at 6:07 PM, sachin sachin_mi...@yahoo.co.in wrote:
We can make a spanning tree for these 2N points
@Varun S V
Appending the nodes to the first subtree will result in O(mlgn) as
each node of second BST will have to go through log n level of the
first BST
On Jan 29, 12:37 am, Varun S V varun...@gmail.com wrote:
Delete the nodes in the second BST in postorder. As and when you delete this
node,
