Bounding the Running Time of Algorithms for Scheduling and Packing Problems

zum Volltext (510 kB)   ZIP
Beteiligte Person(en) / Institution(en)Autor :
DatumErschienen :
  • April 2013

We investigate the implications of the exponential time hypothesis on algorithms for scheduling and packing problems. Our main focus is to show tight lower bounds on the running time of these algorithms. For exact algorithms we investigate the dependence of the running time on the number n of items (for packing) or jobs (for scheduling). We show that many of these problems, including SUBSET SUM, KNAPSACK, BIN PACKING, P2||Cmax, and P2||∑wjCj, have a lower bound of 2o(n)×∥I∥O(n). We also develop an algorithmic framework that is able to solve a large number of scheduling and packing problems in time 2O(n)×∥I∥O(n). Finally, we show that there is no PTAS for MULTIPLE KNAPSACK and 2D-KNAPSACK with running time 2o(1ε)×∥I∥O(n) and no(1ε)×∥I∥O(n).
Statische URLhttps://www.uni-kiel.de/journals/receive/jportal_jparticle_00000015
 
URN:NBNurn:nbn:de:101:1-201304308589
IDNummer des Berichts :
  • TR_1302