Dr. Lin Chen

Foto Zentrum Mathematik, M9
Technische Universität München
Boltzmannstr. 3
85747 Garching bei München
Germany

Office: 02.04.059
Phone: +49 (0)89 289-16850
E-Mail: chenlin198662gmail.com

Office hours: by appointment
 

Research Interests

  • Scheduling, Bin packing and Knapsack
  • Approximation and Online Algorithms
  • Complexity and FPT algorithms

Recent Publications

  • Chen, L., Megow, N., Schewior, K.: An O(log m)-competitive algorithm for online machine minimization. To appear in SODA 2016.
  • Chen, L., Megow, N., Rischke R., Stougie, L.: Stochastic and robust scheduling in the cloud. In Proceedings of APPROX-RANDOM 2015, 175--186.
  • Chen, L., Megow, N., Rischke R., Stougie, L., Verschae, J.: Optimal algorithms and a PTAS for cost-aware scheduling. In Proceedings of MFCS 2015, 211--222.
  • Chen, L., Jansen, K., Zhang, G.C.: On the optimality of approximation schemes for the classical scheduling problem. In Proceedings of SODA 2014, 657--668, 2014
  • Chen, L., Ye, D.S., Zhang, G.C.: Online Scheduling of mixed CPU-GPU jobs. International Journal of Foundations of Computer Science, 25(6), 745--762, 2014
  • Chen, L., Ye, D.S., Zhang, G.C.: An asymptotic competitive scheme for online bin packing. In Proceedings of COCOA 2014, 13--24
  • Chen, L., Ye, D.S., Zhang, G.C.: An improved lower bound for rank four scheduling. Operations Research Letters, 42, 348--350, 2014
  • A full list of publications can be found at My homepage .

Projects