Combination of parallel machine scheduling and vertex cover

Authors:
Zhenbo Wang;Zhenhua Cui
Affiliations:
-;-
Venue:
Theoretical Computer Science
Year:
2012

Citing 13
Cited 0

Using dual approximation algorithms for scheduling problems theoretical and practical results

Journal of the ACM (JACM)
Approximation algorithms for NP-hard problems

Approximation algorithms for NP-hard problems
A unified approximation algorithm for node-deletion problems

Discrete Applied Mathematics
Algorithms for Scheduling Independent Tasks

Journal of the ACM (JACM)
A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem

SIAM Journal on Discrete Mathematics
A unified approach to approximating resource allocation and scheduling

Journal of the ACM (JACM)
Scheduling split intervals

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Approximating element-weighted vertex deletion problems for the complete k-partite property

Journal of Algorithms
On the Equivalence between the Primal-Dual Schema and the Local-Ratio Technique

APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Local ratio: A unified framework for approximation algorithms. In Memoriam: Shimon Even 1935-2004

ACM Computing Surveys (CSUR)
Vertex cover might be hard to approximate to within 2-ε

Journal of Computer and System Sciences
Local ratio with negative weights

Operations Research Letters

Quantified Score

Hi-index	5.23

Visualization

Abstract

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 makespan is minimized. We develop an approximation algorithm based on the local ratio method and the LPT rule, and prove that it is a (3-2m+1)-approximation algorithm.