Abstract We will present several lower bounds on the running times for both exact and approximation algorithms based on the exponential time hypothesis (ETH) mainly for scheduling and packing problems (including some open problems). Attachment File Lower Bounds on the Running Time for Scheduling and Packing Problems Video Recording
