Login / Signup

A Near-linear Time Constant Factor Algorithm for Unsplittable Flow Problem on Line with Bag Constraints.

Venkatesan T. ChakaravarthyAnamitra R. ChoudhuryYogish Sabharwal
Published in: FSTTCS (2010)
Keyphrases
  • worst case
  • learning algorithm
  • optimal solution
  • constant factor
  • computational complexity
  • k means
  • machine learning
  • objective function
  • search space
  • np hard
  • upper bound
  • constraint satisfaction