MULTIDIMENSIONAL DIVIDE-AND-CONQUER MAXIMIN RECURRENCES

被引：5

作者：

ALONSO, L ^{[1
]}

REINGOLD, EM ^{[1
]}

SCHOTT, R ^{[1
]}

机构：

[1] ECOLE NORMALE SUPER,F-75005 PARIS,FRANCE

来源：

SIAM JOURNAL ON DISCRETE MATHEMATICS | 1995年 / 8卷 / 03期

关键词：

RECURRENCE RELATIONS; DIVIDE AND CONQUER; ALGORITHMIC ANALYSIS; PARTITION TREES;

D O I：

10.1137/S0895480192232862

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Bounds are obtained for the solution to the divide-and-conquer recurrence M(n)=(k(1)+...+k(p)=n)max (M(k(1))+M(k(2))+...+M(k(p))+min(f(k(1)),...,f(k(p)))), for nondecreasing functions f. Similar bounds are found for the recurrence with ''min'' replaced by ''sum-of-all-but-the-max.'' Such recurrences appear in the analysis of various algorithms. The bounds follow from analyses of partition trees.

引用

页码：428 / 447

页数：20

共 50 条

[1] Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences
Wang, BF
[J]. THEORETICAL COMPUTER SCIENCE, 2000, 242 (1-2) : 377 - 401
[2] MULTIDIMENSIONAL DIVIDE-AND-CONQUER
BENTLEY, JL
[J]. COMMUNICATIONS OF THE ACM, 1980, 23 (04) : 214 - 229
[3] SOLUTION OF A DIVIDE-AND-CONQUER MAXIMIN RECURRENCE
LI, Z
REINGOLD, EM
[J]. SIAM JOURNAL ON COMPUTING, 1989, 18 (06) : 1188 - 1200
[4] A frame for general divide-and-conquer recurrences
Wang, XD
Fu, QX
[J]. INFORMATION PROCESSING LETTERS, 1996, 59 (01) : 45 - 51
[5] Divide-and-conquer recurrences - Classification of asymptotics
Derfel G.
Vogl F.
[J]. aequationes mathematicae, 2000, 60 (3) : 243 - 257
[6] Floors and Ceilings in Divide-and-Conquer Recurrences
Kuszmaul, William
Leiserson, Charles E.
[J]. 2021 SYMPOSIUM ON SIMPLICITY IN ALGORITHMS, SOSA, 2021, : 133 - 141
[7] Tighter bounds on the solution of a divide-and-conquer maximin recurrence
Wang, BF
[J]. JOURNAL OF ALGORITHMS, 1997, 23 (02) : 329 - 344
[8] Improved master theorems for divide-and-conquer recurrences
Roura, S
[J]. JOURNAL OF THE ACM, 2001, 48 (02) : 170 - 205
[9] An improved master theorem for divide-and-conquer recurrences
Roura, S
[J]. AUTOMATA, LANGUAGES AND PROGRAMMING, 1997, 1256 : 449 - 459
[10] USING FRACTAL GEOMETRY FOR SOLVING DIVIDE-AND-CONQUER RECURRENCES
DUBE, S
[J]. JOURNAL OF THE AUSTRALIAN MATHEMATICAL SOCIETY SERIES B-APPLIED MATHEMATICS, 1995, 37 : 145 - 171

← 1 2 3 4 5 →