Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

17

ESA
2005
Springer

favoriteEmaildiscussreport

146views Algorithms» more ESA 2005»

An Approximation Algorithm for the Minimum Latency Set Cover Problem

13 years 10 months ago

An Approximation Algorithm for the Minimum Latency Set Cover Problem

Download pluto.huji.ac.il

The input to the minimum latency set cover problem (MLSC) consists of a set of jobs and a set of tools. Each job j needs a speciﬁc 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.3

Refael Hassin, Asaf Levin

Real-time Traffic

ESA 2005 | Latency Set Cover | Minimum Latency | Subset Sj |

claim paper

Related Content

» The MinimumEntropy Set Cover Problem

» Approximation Algorithms for Partial Covering Problems

» Interference in Cellular Networks The Minimum Membership Set Cover Problem

» Polynomial time approximation schemes for minimum disk cover problems

» An Approximation Algorithm for Weighted Weak Vertex Cover Problem in Undirected Graphs

» Approximating node connectivity problems via set covers

» Tight Results on Minimum Entropy Set Cover

» An Almost Linear Time 28334Approximation Algorithm for the Disc Covering Problem

» Covering a Set of Points with a Minimum Number of Lines

Post Info
More Details (n/a)

Added	27 Jun 2010
Updated	27 Jun 2010
Type	Conference
Year	2005
Where	ESA
Authors	Refael Hassin, Asaf Levin

Comments (0)