AN ALMOST LINEAR TIME ALGORITHM FOR GENERALIZED MATRIX SEARCHING

被引：44

作者：

KLAWE, MM ^{[1
]}

KLEITMAN, DJ ^{[1
]}

机构：

[1] MIT,DEPT MATH,CAMBRIDGE,MA 02139

来源：

关键词：

D O I：

10.1137/0403009

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：81 / 97

页数：17

共 7 条

[1]

Aggarwal A., 1988, 29th Annual Symposium on Foundations of Computer Science (IEEE Cat. No.88CH2652-6), P497, DOI 10.1109/SFCS.1988.21966

[2] GEOMETRIC APPLICATIONS OF A MATRIX-SEARCHING ALGORITHM [J].

AGGARWAL, A ;

KLAWE, MM ;

MORAN, S ;

SHOR, P ;

WILBER, R .

[3]

AGGARWAL A, IN PRESS DISCRETE AP

[4]

Eppstein D., 1988, 29th Annual Symposium on Foundations of Computer Science (IEEE Cat. No.88CH2652-6), P488, DOI 10.1109/SFCS.1988.21965

[5] THE LEAST WEIGHT SUBSEQUENCE PROBLEM [J].

HIRSCHBERG, DS ;

LARMORE, LL .

[6] THE CONCAVE LEAST-WEIGHT SUBSEQUENCE PROBLEM REVISITED [J].

WILBER, R .

[7] SPEED-UP IN DYNAMIC-PROGRAMMING [J].

YAO, FF .

SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1982, 3 (04) :532-540