A polynomial-time algorithm for max-min partitioning of ladders

被引：11
|
作者：
Becker, R [1 ]
Lari, I
Lucertini, M
Simeone, B
机构：
[1] Univ Cape Town, Dept Math, ZA-7700 Rondebosch, South Africa
[2] Univ Roma La Sapienza, Dept Stat, I-00185 Rome, Italy
[3] Univ Roma Tor Vergata, Ctr Matemat Vito Volterra, I-00173 Rome, Italy
[4] Univ Roma Tor Vergata, Dept Elect Engn, I-00173 Rome, Italy
来源：
THEORY OF COMPUTING SYSTEMS | 2001年 / 34卷 / 04期
关键词：
Short Path; Solution Time; Minimum Weight; Dynamic Programming Algorithm; Short Path Problem;
D O I：
10.1007/s00224-001-0008-8
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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 (N(4)p max{p, log N})-time algorithm, which combines dynamic programming with pre-processing and search techniques. An 0 (N) -time algorithm for the case p = 2 is also given. In a companion paper [2] we show that the problem for a grid graph with three rows is NP-hard, and we give approximate algorithms for grid graphs with an arbitrary number of rows.
引用
收藏
页码：353 / 374
页数：22
相关论文
共 50 条
  • [31] Min-max and max-min graph saturation parameters
    Sudha, S.
    Arumugam, S.
    [J]. AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2020, 17 (03) : 943 - 947
  • [32] Iteration algorithm for solving Ax = b in max-min algebra
    Allame, Masould
    Vatankhahan, Behnaz
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2006, 175 (01) : 269 - 276
  • [33] Interior Point Algorithm for Constrained Sequential Max-Min Problems
    Fan, Xiaona
    Yan, Qinglun
    [J]. INFORMATION COMPUTING AND APPLICATIONS, 2010, 6377 : 415 - 422
  • [34] Max-Min Greedy Matching
    Eden, Alon
    Feige, Uriel
    Feldman, Michal
    [J]. PROCEEDINGS OF THE 14TH WORKSHOP ON THE ECONOMICS OF NETWORKS, SYSTEMS AND COMPUTATION (NETECON '19), 2019,
  • [35] MAX-MIN PURSUIT GAME
    HEYMANN, M
    PACHTER, M
    [J]. JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 1979, 70 (02) : 430 - 444
  • [36] Research on the utility max-min fair algorithm of resource allocation
    Xu, T
    Liao, JX
    [J]. PERFORMANCE CHALLENGES FOR EFFICIENT NEXT GENERATION NETWORKS, VOLS 6A-6C, 2005, 6A-6C : 1967 - 1976
  • [37] An approximation algorithm for the general max-min resource sharing problem
    Klaus Jansen
    [J]. Mathematical Programming, 2006, 106 : 547 - 566
  • [38] An Optimal Local Approximation Algorithm for Max-Min Linear Programs
    Floreen, Patrik
    Kaasinen, Joel
    Kaski, Petteri
    Suomela, Jukka
    [J]. SPAA'09: PROCEEDINGS OF THE TWENTY-FIRST ANNUAL SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, 2009, : 260 - 269
  • [39] An approximation algorithm for the general max-min resource sharing problem
    Jansen, K
    [J]. MATHEMATICAL PROGRAMMING, 2006, 106 (03) : 547 - 566
  • [40] An iterative algorithm for the Max-Min knapsack problem with multiple scenarios
    Thekra Al-douri
    Mhand Hifi
    Vassilis Zissimopoulos
    [J]. Operational Research, 2021, 21 : 1355 - 1392
12345