WORST-CASE ANALYSIS OF THE SET-UNION PROBLEM WITH EXTENDED BACKTRACKING

被引：4

作者：

GAMBOSI, G

ITALIANO, GF

TALAMO, M

机构：

[1] UNIV ROME LA SAPIENZA,DIPARTIMENTO INFORMAT & SISTEMIST,VIA BUONARROTI 12,I-00185 ROME,ITALY

[2] UNIV SALERNO,DIPARTIMENTO INFORMAT & APPLICAZIONI,I-84100 SALERNO,ITALY

来源：

THEORETICAL COMPUTER SCIENCE | 1989年 / 68卷 / 01期

关键词：

D O I：

10.1016/0304-3975(89)90119-9

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：57 / 70

页数：14

共 50 条

[1] WORST-CASE ANALYSIS OF SET UNION ALGORITHMS
TARJAN, RE
VANLEEUWEN, J
JOURNAL OF THE ACM, 1984, 31 (02) : 245 - 281
[2] A PARTIALLY PERSISTENT DATA STRUCTURE FOR THE SET-UNION PROBLEM WITH BACKTRACKING
GAIBISSO, C
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 381 : 128 - 135
[3] Effect of Backtracking Strategy in Population-Based Approach: The Case of the Set-Union Knapsack Problem
Dahmani, Isma
Ferroum, Meriem
Hifi, Mhand
CYBERNETICS AND SYSTEMS, 2022, 53 (01) : 168 - 185
[4] On the complexity of a set-union problem
Lipton, RJ
Martino, PJ
Neitzke, A
38TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1997, : 110 - 115
[5] A parallel solution to the extended set union problem with unlimited backtracking
Pinotti, MC
Crupi, VA
Das, SK
10TH INTERNATIONAL PARALLEL PROCESSING SYMPOSIUM - PROCEEDINGS OF IPPS '96, 1996, : 182 - 186
[6] Note: on the set-union knapsack problem
Goldschmidt, O.
Nehme, D.
Yu, G.
Naval Research Logistics, 1994, 41 (06)
[7] THE SET UNION PROBLEM WITH BACKTRACKING
MANNILA, H
UKKONEN, E
LECTURE NOTES IN COMPUTER SCIENCE, 1986, 226 : 236 - 243
[8] ON THE SET-UNION KNAPSACK-PROBLEM
GOLDSCHMIDT, O
NEHME, D
YU, G
NAVAL RESEARCH LOGISTICS, 1994, 41 (06) : 833 - 842
[9] ON THE SINGLE-OPERATION WORST-CASE TIME-COMPLEXITY OF THE DISJOINT SET UNION PROBLEM
BLUM, N
SIAM JOURNAL ON COMPUTING, 1986, 15 (04) : 1021 - 1024
[10] ON THE SINGLE-OPERATION WORST-CASE TIME-COMPLEXITY OF THE DISJOINT SET UNION PROBLEM
BLUM, N
LECTURE NOTES IN COMPUTER SCIENCE, 1985, 182 : 32 - 38

← 1 2 3 4 5 →