• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

A Fast Distributed Approximation Algorithm for Minimum Spanning Trees.

Maleq KhanGopal Pandurangan
Published in: DISC (2006)
Keyphrases
  • np hard
  • learning algorithm
  • objective function
  • expectation maximization
  • segmentation algorithm
  • clustering method
  • tree structure
  • computational complexity
  • pairwise
  • worst case
  • simulated annealing