An approximation algorithm for the minimum latency set cover problem

Authors:
Refael Hassin;Asaf Levin
Affiliations:
Department of Statistics and Operations Research, Tel-Aviv University, Tel-Aviv, Israel;Department of Statistics, The Hebrew University, Jerusalem, Israel
Venue:
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Year:
2005

Citing 5
Cited 3

The minimum latency problem

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Scheduling to minimize average completion time: off-line and on-line approximation algorithms

Mathematics of Operations Research
Computer-Aided complexity classification of combinational problems

Communications of the ACM
Scheduling Algorithms

Scheduling Algorithms
Approximating Min Sum Set Cover

Algorithmica

Multiple intents re-ranking

Proceedings of the forty-first annual ACM symposium on Theory of computing
A constant factor approximation algorithm for generalized min-sum set cover

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Ranking with submodular valuations

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.