k-Partitioning problems with partition matroid constraint

被引：2
|
作者：
Wu, Biao [1 ]
Yao, Enyue [1 ]
机构：
[1] Zhejiang Univ, Dept Math, Hangzhou 310027, Peoples R China
来源：
THEORETICAL COMPUTER SCIENCE | 2007年 / 374卷 / 1-3期
关键词：
partitioning; constrained partition; analysis of algorithm; worst case ratio;
D O I：
10.1016/j.tcs.2006.11.016
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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. (C) 2006 Elsevier B.V. All rights reserved.
引用
收藏
页码：41 / 48
页数：8
相关论文
共 50 条
  • [1] Approximation algorithms for k-partitioning problems with partition matroid constraint
    Li, Weidong
    Li, Jianping
    OPTIMIZATION LETTERS, 2014, 8 (03) : 1093 - 1099
  • [2] Lower bounds and modified LPT algorithm for k-partitioning problems with partition matroid constraint
    Wu Biao
    Yao En-yu
    APPLIED MATHEMATICS-A JOURNAL OF CHINESE UNIVERSITIES SERIES B, 2008, 23 (01) : 1 - 8
  • [3] Lower bounds and modified LPT algorithm for k-partitioning problems with partition matroid constraint
    WU Biao YAO En-yu Dept.of Math.
    AppliedMathematics:AJournalofChineseUniversities(SeriesB), 2008, (01) : 1 - 8
  • [4] Lower bounds and modified LPT algorithm for k-partitioning problems with partition matroid constraint
    Biao Wu
    En-yu Yao
    Applied Mathematics-A Journal of Chinese Universities, 2008, 23 : 1 - 8
  • [5] k-partitioning problems for maximizing the minimum load
    He, Y
    Tan, ZY
    Zhu, J
    Yao, EY
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2003, 46 (10-11) : 1671 - 1681
  • [6] The k-partitioning problem
    Babel, L
    Kellerer, H
    Kotov, V
    MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 1998, 47 (01) : 59 - 82
  • [7] On k-partitioning of Hamming graphs
    Bezrukov, SL
    Elsässer, R
    Schroeder, UP
    DISCRETE APPLIED MATHEMATICS, 1999, 95 (1-3) : 127 - 140
  • [8] Multiply Balanced k-Partitioning
    Amir, Amihood
    Ficler, Jessica
    Krauthgamer, Robert
    Roditty, Liam
    Shalom, Oren Sar
    LATIN 2014: THEORETICAL INFORMATICS, 2014, 8392 : 586 - 597
  • [9] Counting and Enumerating Optimum Cut Sets for Hypergraph k-Partitioning Problems for Fixed k
    Beideman, Calvin
    Chandrasekaran, Karthekeyan
    Wang, Weihang
    MATHEMATICS OF OPERATIONS RESEARCH, 2024, 49 (04) : 2579 - 2601
  • [10] K-Partitioning with Imprecise Probabilistic Edges
    Davot, Tom
    Destercke, Sebastien
    Savourey, David
    BUILDING BRIDGES BETWEEN SOFT AND STATISTICAL METHODOLOGIES FOR DATA SCIENCE, 2023, 1433 : 87 - 95
12345