k-Partitioning problems with partition matroid constraint

Authors:
Biao Wu;Enyue Yao
Affiliations:
Department of Mathematics, Zhejiang University, Hangzhou 310027, PR China;Department of Mathematics, Zhejiang University, Hangzhou 310027, PR China
Venue:
Theoretical Computer Science
Year:
2007

Citing 3
Cited 0

A tight bound for 3-partitioning

Discrete Applied Mathematics - ARIDAM IV and V
On uniform k-partition problems

Discrete Applied Mathematics - Special issue: Max-algebra
The exact LPT-bound for maximizing the minimum completion time

Operations Research Letters

Quantified Score

Hi-index	5.23

Visualization

Abstract

In this paper, we consider the k-partitioning problems with partition matroid constraint and present an algorithm called the layered LPT algorithm. With the objective of minimizing the maximum load, we show that the layered LPT algorithm has a tight worst case ratio of 2-1/m. With the objective of maximizing the minimum load, we show that the layered LPT algorithm has a tight worst case ratio of 1/m for the general case and, with certain conditions, the worst ratio can be improved to m/(2m-1) for the general k case and to (m-1)/(2m-3) for the k=3 case.