An approximation algorithm for the minimum latency set cover problem

Refael Hassin*, Asaf Levin

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

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.

Original languageEnglish
Pages (from-to)726-733
Number of pages8
JournalLecture Notes in Computer Science
Volume3669
DOIs
StatePublished - 2005
Event13th Annual European Symposium on Algorithms, ESA 2005 - Palma de Mallorca, Spain
Duration: 3 Oct 20056 Oct 2005

Keywords

  • Approximation algorithm
  • Minimum latency
  • Minimum sum set cover

Fingerprint

Dive into the research topics of 'An approximation algorithm for the minimum latency set cover problem'. Together they form a unique fingerprint.

Cite this