Login / Signup

Greedy heuristics for the bounded diameter minimum spanning tree problem.

Bryant A. Julstrom
Published in: ACM J. Exp. Algorithmics (2009)
Keyphrases
  • greedy heuristics
  • scheduling problem
  • set cover
  • evolutionary algorithm
  • genetic algorithm
  • search algorithm
  • np hard
  • maximum distance
  • database
  • approximation algorithms