BOUNDING THE RUNNING TIME OF ALGORITHMS FOR SCHEDULING AND PACKING PROBLEMS

Jansen, Klaus, Land, F. and Land, K. (2016) BOUNDING THE RUNNING TIME OF ALGORITHMS FOR SCHEDULING AND PACKING PROBLEMS Siam Journal on Discrete Mathematics, 30 (1). pp. 343-366. DOI 10.1007/978-3-642-40104-6_38.

Full text not available from this repository.

Supplementary data:

Abstract

Our goal is to show tight bounds on the running time of algorithms for scheduling and packing problems. To prove lower bounds, we investigate implications of the exponential time hypothesis on such algorithms. For exact algorithms we consider the dependence of the running time on the number n of items (for packing) or jobs (for scheduling). We prove a lower bound of 2(o(n)) x vertical bar vertical bar I vertical bar vertical bar(O(n)), where vertical bar vertical bar I vertical bar vertical bar denotes the encoding length of the instance, for several of these problems, including SUBSETSUM, KNAPSACK, BINPACKING, < P2 vertical bar vertical bar C-max >, and < P2 vertical bar vertical bar Sigma w(j)C(j)>. We also develop an algorithmic framework that is able to solve a large number of scheduling and packing problems in time 2o(n) x vertical bar vertical bar I vertical bar vertical bar(O(n)). Finally, we consider approximation schemes. We show that there is no polynomial time approximation scheme for MULTIPLEKNAPSACK (MKS) and 2D-KNAPSACK with running time 2(o(1/epsilon)) x vertical bar vertical bar I vertical bar vertical bar(O(n)) and n(o(1/epsilon)) x vertical bar vertical bar I vertical bar vertical bar(O(n)), respectively.

Document Type: Article
Additional Information: Times Cited: 0 Jansen, K. Land, F. Land, K.
Research affiliation: OceanRep > The Future Ocean - Cluster of Excellence
Kiel University
Refereed: Yes
DOI etc.: 10.1007/978-3-642-40104-6_38
ISSN: 0895-4801
Projects: Future Ocean
Date Deposited: 24 Feb 2017 13:55
Last Modified: 19 Dec 2017 12:44
URI: http://eprints.uni-kiel.de/id/eprint/36154

Actions (login required)

View Item View Item