Login / Signup

Near-Optimal Online Algorithms for Prize-Collecting Steiner Problems.

MohammadTaghi HajiaghayiVahid LiaghatDebmalya Panigrahi
Published in: ICALP (1) (2014)
Keyphrases
  • online algorithms
  • prize collecting
  • computational complexity
  • lower bound
  • machine learning
  • learning algorithm
  • worst case
  • optimization problems
  • benchmark problems
  • average case