Min-max partitioning problem with matroid constraint

被引：0
|
作者：
Wu, Biao [1 ]
Yao, En-yu [1 ]
机构：
[1] Zhejiang Univ, Dept Math, Hangzhou 310027, Peoples R China
来源：
JOURNAL OF ZHEJIANG UNIVERSITY-SCIENCE A | 2008年 / 9卷 / 10期
基金：
中国国家自然科学基金;
关键词：
matroid; matroid partition; worst ratio;
D O I：
10.1631/jzus.A071606
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
In this paper, we consider the set partitioning problem with matroid constraint, which is a generation of the k-partitioning problem. The objective is to minimize the weight of the heaviest subset. We present an approximation algorithm, which consists of two sub-algorithms-the modified Edmonds' matroid partitioning algorithm and the exchange algorithm, for the problem. An estimation of the worst ratio for the algorithm is given.
引用
收藏
页码：1446 / 1450
页数：5
相关论文
共 50 条
12345