LINEAR-PROGRAMMING IN LINEAR TIME WHEN THE DIMENSION IS FIXED

被引：394

作者：

MEGIDDO, N ^{[1
]}

机构：

[1] TEL AVIV UNIV,IL-69978 TEL AVIV,ISRAEL

来源：

JOURNAL OF THE ACM | 1984年 / 31卷 / 01期

关键词：

D O I：

10.1145/2422.322418

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 [计算机科学与技术];

摘要：

引用

收藏

页码：114 / 127

页数：14

相关论文

共 18 条

[1]

Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[2]

[Anonymous], 1972, COMPUTER ORIENTED AP

[3]

MULTIDIMENSIONAL DIVIDE-AND-CONQUER [J].

BENTLEY, JL .

COMMUNICATIONS OF THE ACM, 1980, 23 (04) :214-229

[4]

Duda R. O., 1973, PATTERN CLASSIFICATI

[5]

EXPECTED TIME BOUNDS FOR SELECTION [J].

FLOYD, RW ;

RIVEST, RL .

COMMUNICATIONS OF THE ACM, 1975, 18 (03) :165-172

[6]

Grunbaum B, 1967, CONVEX POLYTOPES

[7]

Khachian L. G., 1979, SOV MATH DOKL, V20, P191

[8]

Klee V., 1972, INEQUALITIES, V3, P159

[9]

TOWARDS A GENUINELY POLYNOMIAL ALGORITHM FOR LINEAR-PROGRAMMING [J].

MEGIDDO, N .

SIAM JOURNAL ON COMPUTING, 1983, 12 (02) :347-353

[10]

IS BINARY ENCODING APPROPRIATE FOR THE PROBLEM-LANGUAGE RELATIONSHIP [J].

MEGIDDO, N .

THEORETICAL COMPUTER SCIENCE, 1982, 19 (03) :337-341