THE LEAST WEIGHT SUBSEQUENCE PROBLEM

被引:47
作者
HIRSCHBERG, DS
LARMORE, LL
机构
关键词
D O I
10.1137/0216043
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:628 / 638
页数:11
相关论文
共 6 条
[1]   OPTIMAL PAGINATION OF B-TREES WITH VARIABLE-LENGTH ITEMS [J].
DIEHR, G ;
FAALAND, B .
COMMUNICATIONS OF THE ACM, 1984, 27 (03) :241-247
[2]  
HIRSCHBERG DS, IN PRESS J ASS COMPU
[3]  
KNUTH DE, 1981, SOFTWARE PRACTICE EX, P1119
[4]   EFFICIENT OPTIMAL PAGINATION OF SCROLLS [J].
LARMORE, LL ;
HIRSCHBERG, DS .
COMMUNICATIONS OF THE ACM, 1985, 28 (08) :854-856
[5]  
LARMORE LL, 1984, 22ND P ANN ALL C COM
[6]  
[No title captured]