PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Nonner, Tim"

Author of the publication

copydeleteadd this publication to your clipboard
The bell is ringing in speed-scaled multiprocessor scheduling.

, , and . SPAA, page 11-18. ACM, (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Tim Engling University of Stuttgart

Tim Hornung University of Stuttgart

Tim Mayer University of Stuttgart

Tim Uhlemann University of Stuttgart

Dr. -Ing. Tim Belschner University of Stuttgart

 

Other publications of authors with the same name

Latency Constrained Aggregation in Chain Networks Admits a PTAS., and . AAIM, volume 5564 of Lecture Notes in Computer Science, page 279-291. Springer, (2009)Approximating the Joint replenishment Problem with Deadlines., and . Discrete Math., Alg. and Appl., 1 (2): 153-174 (2009)An Efficient Polynomial-Time Approximation Scheme for the Joint Replenishment Problem., and . IPCO, volume 7801 of Lecture Notes in Computer Science, page 314-323. Springer, (2013)Capacitated max -Batching with Interval Graph Compatibilities.. SWAT, volume 6139 of Lecture Notes in Computer Science, page 176-187. Springer, (2010)Approximation in batch and multiprocessor scheduling.. University of Freiburg, (2010)Capacitated Max-Batching with interval graph compatibilities.. Theor. Comput. Sci., (2016)A 5/3-Approximation Algorithm for Joint Replenishment with Deadlines., and . COCOA, volume 5573 of Lecture Notes in Computer Science, page 24-35. Springer, (2009)Optimal Algorithms for Train Shunting and Relaxed List Update Problems., and . ATMOS, volume 25 of OASIcs, page 97-107. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)SRPT is 1.86-Competitive for Completion Time Scheduling., , and . SODA, page 1373-1388. SIAM, (2010)Polynomial-Time Approximation Schemes for Shortest Path with Alternatives.. ESA, volume 7501 of Lecture Notes in Computer Science, page 755-765. Springer, (2012)