Sciweavers

Share
ICCSA
2004
Springer

Packing: Scheduling, Embedding, and Approximating Metrics

12 years 1 months ago
Packing: Scheduling, Embedding, and Approximating Metrics
Abstract. Many problems in computer science are related to scheduling problems or embedding problems. Therefore it is an interesting topic to find efficient (approximation) algorithms for these two classes of problems. In this paper, we present fast approximation algorithms for scheduling on unrelated machines, job shop scheduling, network embeddings and approximating metrics. As the usual technique, we consider the fractional relaxations of the integral problems. By appropriate formulation, these problems can be solved with the approximation algorithms for general packing problems by Jansen and Zhang [18] (with rounding techniques if necessary). For approximating metrics problem, which can not be solved by most traditional methods efficiently, we show that our algorithm can deliver the desired approximate solution fast.
Hu Zhang
Added 01 Jul 2010
Updated 01 Jul 2010
Type Conference
Year 2004
Where ICCSA
Authors Hu Zhang
Comments (0)
books