The input to the MINIMUM LATENCY SET COVER PROBLEM consists of a set of jobs and a set of tools. Each job j needs a specific subset Sj of the tools in order to be processed. It is possible to install a single tool in every time unit. Once the entire subset Sj has been installed, job j can be processed instantly. The problem is to determine an order of job installations which minimizes the weighted sum of job completion times. We show that this problem is NP-hard in the strong sense and provide an e-approximation algorithm. Our approximation algorithm uses a framework of approximation algorithms which were developed for the minimum latency problem. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Hassin, R., & Levin, A. (2005). An approximation algorithm for the minimum latency set cover problem. In Lecture Notes in Computer Science (Vol. 3669, pp. 726–733). Springer Verlag. https://doi.org/10.1007/11561071_64
Mendeley helps you to discover research relevant for your work.