GENERALIZED SELECTION AND RANKING - SORTED MATRICES

被引：118

作者：

FREDERICKSON, GN ^{[1
]}

JOHNSON, DB ^{[1
]}

机构：

[1] PENN STATE UNIV,DEPT COMP SCI,UNIVERSITY PK,PA 16802

来源：

SIAM JOURNAL ON COMPUTING | 1984年 / 13卷 / 01期

关键词：

D O I：

10.1137/0213002

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：14 / 30

页数：17

共 27 条

[1]

Bentley J. L., 1976, Information Processing Letters, V5, P82, DOI 10.1016/0020-0190(76)90071-5

[2]

BLUM M, 1972, J COMPUT SYST SCI, V7, P448

[3] AN O((N LOG P)2) ALGORITHM FOR THE CONTINUOUS P-CENTER PROBLEM ON A TREE [J].

CHANDRASEKARAN, R ;

TAMIR, A .

SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1980, 1 (04) :370-375

[4] POLYNOMIALLY BOUNDED ALGORITHMS FOR LOCATING P-CENTERS ON A TREE [J].

CHANDRASEKARAN, R ;

TAMIR, A .

MATHEMATICAL PROGRAMMING, 1982, 22 (03) :304-315

[5]

DOBKIN DP, COMMUNICATION

[6] THE COMPLEXITY OF SELECTION AND RANKING IN X + Y AND MATRICES WITH SORTED COLUMNS [J].

FREDERICKSON, GN ;

JOHNSON, DB .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1982, 24 (02) :197-208

[7] FINDING KTH PATHS AND PARA-CENTERS BY GENERATING AND SEARCHING GOOD DATA-STRUCTURES [J].

FREDERICKSON, GN ;

JOHNSON, DB .

JOURNAL OF ALGORITHMS, 1983, 4 (01) :61-80

[8]

FREDERICKSON GN, 1980, 12TH P ACM S THEOR C, P420

[9]

FREDMAN ML, 1979, COMM ACM, V21, P227

[10]

FUSSENEGGER F, 1979, J ASSOC COMPUT MACH, V26, P540

← 1 2 3 →