I was going through this paper for understanding the algorithm for k dimensional euclidean mst. I am not getting, how to implement this. How do I choose arbitrary C1 for building grid.(Given on Page 4)
Here is the algorithm for EMST given-
for every point p ∈ V do
Identify the set Q of points that are within a distance of
√C1/n from p (for some constant C1 > 1).
Q is identified using the grid that has been created
Can anyone help in this. Also, I could not get enough articles/posts regarding this topic other than research papers. Please share if you have some resources for this topic.
No one will answer because it is from ongoing codechef contest even though you are just asking for right direction.I was also reading this paper.the most ridiculous thing about this is that ,after contest ends editorial will be written in alien language and I will not be able to solve it even when contest ends
I didn't even know that this was from a contest. I was completing my research thesis and used this paper as reference, but couldn't understand the above. So asked,I didn't figure that time why was I receiving downvotes