Login / Signup

Tight Bounds for the Advice Complexity of the Online Minimum Steiner Tree Problem.

Kfir Barhum
Published in: SOFSEM (2014)
Keyphrases
  • tight bounds
  • upper bound
  • worst case
  • real time
  • online learning
  • lower complexity
  • neural network
  • metadata
  • machine learning
  • computer vision
  • decision making
  • data structure
  • space complexity
  • high computational complexity