A Polynomial-Time Algorithm for Max-Min Partitioning of Ladders

被引：0
|
作者：
R. Becker
I. Lari
M. Lucertini
B. Simeone
机构：
[1] Department of Mathematics,
[2] Department of Statistics,undefined
[3] Italy,undefined
[4] Department of Electrical Engineering,undefined
[5] Italy,undefined
来源：
Theory of Computing Systems | 2001年 / 34卷
关键词：
Short Path; Solution Time; Minimum Weight; Dynamic Programming Algorithm; Short Path Problem;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Given a grid graph with two rows, an arbitrary number N of columns (briefly, a ladder ) and a weight function defined on its vertex set V , one wants to partition V into a given number p of connected components, so as to maximize the smallest weight of a component. We present an O(N4 pmax  {p,log  N}) -time algorithm, which combines dynamic programming with pre-processing and search techniques. An O(N) -time algorithm for the case p=2 is also given.
引用
收藏
页码：353 / 374
页数：21
相关论文
共 50 条
  • [1] A polynomial-time algorithm for max-min partitioning of ladders
    Becker, R
    Lari, I
    Lucertini, M
    Simeone, B
    [J]. THEORY OF COMPUTING SYSTEMS, 2001, 34 (04) : 353 - 374
  • [2] Polynomial-time Combinatorial Algorithm for General Max-Min Fair Allocation
    Ko, Sheng-Yen
    Chen, Ho-Lin
    Cheng, Siu-Wing
    Hon, Wing-Kai
    Liao, Chung-Shou
    [J]. ALGORITHMICA, 2024, 86 (02) : 485 - 504
  • [3] Polynomial-time Combinatorial Algorithm for General Max–Min Fair Allocation
    Sheng-Yen Ko
    Ho-Lin Chen
    Siu-Wing Cheng
    Wing-Kai Hon
    Chung-Shou Liao
    [J]. Algorithmica, 2024, 86 : 485 - 504
  • [4] FULLY POLYNOMIAL-TIME APPROXIMATION SCHEMES FOR THE MAX-MIN CONNECTED PARTITION PROBLEM ON INTERVAL GRAPHS
    Wu, Bang Ye
    [J]. DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2012, 4 (01)
  • [5] MAX-MIN TREE PARTITIONING
    PERL, Y
    SCHACH, SR
    [J]. JOURNAL OF THE ACM, 1981, 28 (01) : 5 - 15
  • [6] A polynomial algorithm for solving a general max-min fairness problem
    Tomaszewski, A
    [J]. EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS, 2005, 16 (03): : 233 - 240
  • [7] More accurate polynomial-time min-max timing simulation
    Chakraborty, S
    Dill, DL
    [J]. THIRD INTERNATIONAL SYMPOSIUM ON ADVANCED RESEARCH IN ASYNCHRONOUS CIRCUITS AND SYSTEMS, PROCEEDINGS, 1997, : 112 - 123
  • [8] Constrained min-max predictive control:: a polynomial-time approach
    Alamo, T
    de la Peña, DM
    Limon, D
    Camacho, EF
    [J]. 42ND IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-6, PROCEEDINGS, 2003, : 912 - 916
  • [9] Polynomial Time Algorithm for Determining Max-Min Paths in Networks and Solving Zero Value Cyclic Games
    Lozovanu, Dmitrii D.
    [J]. COMPUTER SCIENCE JOURNAL OF MOLDOVA, 2005, 13 (02) : 115 - 130
  • [10] A max-min ant system algorithm with εMAX selection
    Ogawa, Masato
    Li, Lei
    [J]. INFORMATION-AN INTERNATIONAL INTERDISCIPLINARY JOURNAL, 2008, 11 (04): : 467 - 471
12345