Schedule (Friday, 10th September)
| 8:30 - 9:00 | Morning Coffee |
| 09:00 - 9:50 |
Invited Speaker:
Claire Mathieu
Approximation schemes on planar graphs Roberto Solis-Oba |
| 10:00 - 10:20 | Coffee Break |
| 10:20 - 12:00 |
Session 4 (WAOA) Thomas Erlebach |
|
New Lower Bounds for Certain Bin Packing Algorithms J. Balogh, J. Békési and G. Galambos |
|
|
Minimizing Maximum Flowtime of Jobs with Arbitrary Parallelizability K. Pruhs , J. Robert and N. Schabanel |
|
|
Tradeoff between Energy and Throughput for Online Deadline Scheduling H.-L. Chan, T.-W. Lam and R. Li |
|
|
Approximation algorithms for domination search F. V. Fomin, P. Golovach and D. Thilikos |
|
| 12:00 - 13:30 | Lunch |
| 13:30 - 15:10 |
Session 5 (WAOA) Rudolf Fleischer |
|
New Models and Algorithms for Throughput Maximization in Broadcast Scheduling C. Chekuri, A. Gal, S. Im, S. Khuller, J. Li, R. McCutchen, B. Moseley and L. Raschid |
|
|
Lower bounds for Smith's rule in stochastic machine scheduling C. Jagtenberg, U. Schwiegelshohn and M. Uetz |
|
|
A 3/2-approximation algorithm for rate-monotonic multiprocessor scheduling of implicit-deadline tasks A. Karrenbauer and T. Rothvoss |
|
|
The Train Delivery Problem - Vehicle Routing Meets Bin Packing A. Das, C. Mathieu and S. Mozes |
|
| 15:10 - 15:30 | Coffee Break |
| 15:30 - 16:45 |
Session 6 (WAOA) Khaled Elbassioni |
|
The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers P. Briest and H. Röglin |
|
|
k-Edge-Connectivity: Approximation and LP Relaxation D. Pritchard |
|
|
Approximating Survivable Networks with Minimum Number of Steiner Points L. Kamma and Z. Nutov |
