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 条

[21] Max-min separability
Bagirov, AM
[J]. OPTIMIZATION METHODS & SOFTWARE, 2005, 20 (2-3): : 271 - 290
[22] A distributed utility max-min flow control algorithm
Lee, HW
Chong, S
[J]. ICC 2005: IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-5, 2005, : 1063 - 1067
[23] A technique for improving the Max-Min Ant System algorithm
See, Phen Chiak
Wong, Kuan Yew
Komarudin
[J]. 2008 INTERNATIONAL CONFERENCE ON COMPUTER AND COMMUNICATION ENGINEERING, VOLS 1-3, 2008, : 863 - 866
[24] A distributed utility max-min flow control algorithm
Lee, Hyang-Won
Chong, Song
[J]. COMPUTER NETWORKS, 2006, 50 (11) : 1816 - 1830
[25] Combinatorial Algorithm for Restricted Max-Min Fair Allocation
Annamalai, Chidambaram
Kalaitzis, Christos
Svensson, Ola
[J]. ACM TRANSACTIONS ON ALGORITHMS, 2017, 13 (03)
[26] A parallel algorithm to compute the supremum of max-min powers
Suraweera, F
Bhattacharya, P
[J]. COMPUTERS AND ARTIFICIAL INTELLIGENCE, 1996, 15 (06): : 579 - 587
[27] Convergence analysis of a Max-Min ant colony algorithm
Wang, Honghao
Liu, Qing
[J]. DYNAMICS OF CONTINUOUS DISCRETE AND IMPULSIVE SYSTEMS-SERIES B-APPLICATIONS & ALGORITHMS, 2006, 13E : 3901 - 3904
[28] A Distributed Algorithm for Min-Max Tree and Max-Min Cut Problems in Communication Networks
Guo, Song
Leung, Victor C. M.
[J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2010, 18 (04) : 1067 - 1076
[29] An analysis of the LPT algorithm for the max-min and the min-ratio partition problems
Wu, BY
[J]. THEORETICAL COMPUTER SCIENCE, 2005, 349 (03) : 407 - 419
[30] Range of cycle time assignment of max-min systems
Tao, Yue-Gang
Li, Kun-Jie
Liu, Guo-Ping
[J]. Kongzhi Lilun Yu Yingyong/Control Theory and Applications, 2007, 24 (01): : 75 - 78

← 1 2 3 4 5 →