dca's blog

Algorithm for Euclidean MST
By dca, 4 years ago, In English

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.

I previously asked the same 2 days ago, but couldn't figure why I received downvotes. I didn't knew it was from ongoing contest. I apologize for that. Now that the contest is over, can someone tell this.

  • Vote: I like it
  • +23
  • Vote: I do not like it

Comments Comments (2)
| Write comment?
»
4 years ago, # |
  Vote: I like it -28 Vote: I do not like it

Lol, I thought codeforces has intelligent people. But people here memorise some stuff enough to solve puzzles.

→ Reply
  • »
    »
    4 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    If you solve puzzles then you are an intelligent.

    → Reply