Login / Signup

Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem.

Jochen KönemannAsaf LevinAmitabh Sinha
Published in: Algorithmica (2005)
Keyphrases
  • spanning tree
  • maximum distance
  • interval data
  • minmax regret
  • neural network
  • real world
  • information retrieval
  • minimum cost
  • square error
  • real time
  • databases
  • knowledge base
  • image sequences
  • global minimum