Combination of parallel machine scheduling and vertex cover
نویسندگان
چکیده
منابع مشابه
Improved Approximation Algorithm for the Combination of Parallel Machine Scheduling and Vertex Cover
This paper studies a combination of parallel machine scheduling and the vertex cover problem. Given some weighted vertices in an undirected graph, a set of vertices is called a vertex cover if for each edge at least one endpoint belongs to this set. Our problem is to schedule a set of weighted vertices on m identical parallel machines such that the set of vertices is a vertex cover and the make...
متن کاملA Combination of Parallel Machine Scheduling and the Covering Problem
This paper studies a combination problem of parallel machine scheduling and the covering problem. We say a combinatorial optimization problem is a covering problem if it minimizes a linear objective function under some constraints and the variables are binary. The covering problem generalizes many classic combinatorial optimization problems, e.g. the shortest path problem, the vertex cover prob...
متن کاملSimple Round Compression for Parallel Vertex Cover
Recently, Czumaj et al. (arXiv 2017) presented a parallel (almost) 2-approximation algorithm for the maximum matching problem in only O ( (log logn) ) rounds of the massive parallel computation (MPC) framework, when the memory per machine is O(n). The main approach in their work is a way of compressing O(log n) rounds of a distributed algorithm for maximum matching into only O ( (log logn) ) MP...
متن کاملInapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems
Assuming the Unique Games Conjecture (UGC), we show optimal inapproximability results for two classic scheduling problems. We obtain a hardness of 2 − ε for the problem of minimizing the total weighted completion time in concurrent open shops. We also obtain a hardness of 2 − ε for minimizing the makespan in the assembly line problem. These results follow from a new inapproximability result for...
متن کاملParallel Machine Scheduling Problem
A new constructive heuristic for the scheduling problem of n independent jobs on m identical parallel machines with minimum makespan objective is described. The proposed algorithm, which is an n logn algorithm as the LPT algorithm of Graham, iteratively combines partial solutions that are obtained by partitioning the set of jobs in suitable families of subsets. The algorithm was tested using di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2012
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.06.003