Lower bounds for scheduling and packing algorithms assuming the exponential time hypothesis

• Applicant: Professor Dr. Klaus Jansen
• Subject Area: Theoretical Computer Science
• Term: from 2013 to 2017
• Project identifier: Deutsche Forschungsgemeinschaft (DFG) - Project number 236400547

• Final Report Year: 2017

Final Report Abstract

No abstract available

Publications

• „On the optimality of approximation schemes for the classical scheduling problem“. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5-7, 2014. 2014, S. 657-668
  L. Chen, K. Jansen und G. Zhang
  (See online at https://dx.doi.org/10.1137/1.9781611973402.50)
• „Bounding the Running Time of Algorithms for Scheduling and Packing Problems“. In: SIAM J. Discrete Math. 30.1 (2016), S. 343-366
  K. Jansen, F. Land und K. Land
  (See online at https://doi.org/10.1137/140952636)