Login / Signup

Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem.

Jochen KönemannAsaf LevinAmitabh Sinha
Published in: RANDOM-APPROX (2003)
Keyphrases
  • spanning tree
  • maximum distance
  • learning algorithm
  • data sets
  • data mining
  • artificial intelligence
  • case study
  • interval data
  • square error