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 条

[41] A constructive algorithm for max-min paths problems on energy networks
Lozovanu, Dmitrii
Pickl, Stefan
[J]. APPLIED MATHEMATICS AND COMPUTATION, 2008, 204 (02) : 602 - 608
[42] Restricted Max-Min Allocation: Integrality Gap and Approximation Algorithm
Cheng, Siu-Wing
Mao, Yuchen
[J]. ALGORITHMICA, 2022, 84 (07) : 1835 - 1874
[43] Restricted Max-Min Allocation: Integrality Gap and Approximation Algorithm
Siu-Wing Cheng
Yuchen Mao
[J]. Algorithmica, 2022, 84 : 1835 - 1874
[44] DNA Sequencing by Max-Min Ant System and Genetic Algorithm
Liu, Tao
Maeda, Michiharu
[J]. PROCEEDINGS OF THE SEVENTEENTH INTERNATIONAL SYMPOSIUM ON ARTIFICIAL LIFE AND ROBOTICS (AROB 17TH '12), 2012, : 820 - 823
[45] The Research on VRP Based on Max-Min Ant Colony Algorithm
Chen, Changmin
Xie, Weicheng
Fan, Songsong
[J]. ADVANCED RESEARCH ON INFORMATION SCIENCE, AUTOMATION AND MATERIAL SYSTEM, PTS 1-6, 2011, 219-220 : 1285 - +
[46] An iterative algorithm for the Max-Min knapsack problem with multiple scenarios
Al-douri, Thekra
Hifi, Mhand
Zissimopoulos, Vassilis
[J]. OPERATIONAL RESEARCH, 2021, 21 (02) : 1355 - 1392
[47] A Weighted Max-Min Ant Colony Algorithm for TSP Instances
Bu, Yun
Li, Tian Qian
Zhang, Qiang
[J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2015, E98A (03): : 894 - 897
[48] A New Learning Algorithm for a Max-min Fuzzy Neural Network
Yang, J.
Liu, D. L.
Li, L.
Li, Z. X.
[J]. ITESS: 2008 PROCEEDINGS OF INFORMATION TECHNOLOGY AND ENVIRONMENTAL SYSTEM SCIENCES, PT 1, 2008, : 590 - 595
[49] A distributed algorithm for weighted max-min fairness in MPLS networks
Skivée, F
Leduc, G
[J]. TELECOMMUICATIONS AND NETWORKING - ICT 2004, 2004, 3124 : 644 - 653
[50] AN ITERATIVE ALGORITHM FOR TESTING SOLVABILITY OF MAX-MIN INTERVAL SYSTEMS
Myskova, Helena
[J]. KYBERNETIKA, 2012, 48 (05) : 879 - 889

← 1 2 3 4 5 →