WORST-CASE OPTIMAL INSERTION AND DELETION METHODS FOR DECOMPOSABLE SEARCHING PROBLEMS

被引:59
作者
OVERMARS, MH
VANLEEUWEN, J
机构
关键词
D O I
10.1016/0020-0190(81)90093-4
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:168 / 173
页数:6
相关论文
共 15 条
[1]   DECOMPOSABLE SEARCHING PROBLEMS [J].
BENTLEY, JL .
INFORMATION PROCESSING LETTERS, 1979, 8 (05) :244-251
[2]  
KIRKPATRICK DG, 1979, OPTIMAL SEARCH PLANA
[3]  
LUEKER GS, 1978, TRANSFORMATION ADDIN
[4]  
MAURER HA, 1979, 33 TU GRAZ I INF BER
[5]   OPTIMAL DYNAMIZATION OF DECOMPOSABLE SEARCHING PROBLEMS [J].
MEHLHORN, K ;
OVERMARS, MH .
INFORMATION PROCESSING LETTERS, 1981, 12 (02) :93-98
[6]  
MEHLHORN K, 1980, A8005 U SAARL TECHN
[7]   2 GENERAL-METHODS FOR DYNAMIZING DECOMPOSABLE SEARCHING PROBLEMS [J].
OVERMARS, MH ;
VANLEEUWEN, J .
COMPUTING, 1981, 26 (02) :155-166
[8]  
OVERMARS MH, 1980, RUUCS809 U UTR TECHN
[9]  
OVERMARS MH, 1981, SPRINGER LECT NOTES, V104, P224
[10]  
OVERMARS MH, UNPUBLISHED