Login / Signup

Bounding the Running Time of Algorithms for Scheduling and Packing Problems.

Klaus JansenFelix LandKati Land
Published in: SIAM J. Discret. Math. (2016)
Keyphrases
  • optimization problems
  • combinatorial optimization
  • learning algorithm
  • dynamic programming
  • scheduling problem
  • np complete
  • single machine