LINEAR TIME ALGORITHMS FOR 2-VARIABLE AND 3-VARIABLE LINEAR-PROGRAMS

被引：125

作者：

DYER, ME

机构：

[1] Teesside Polytechnic, Dep of, Mathematics & Statistics,, Middlesbrough, Engl, Teesside Polytechnic, Dep of Mathematics & Statistics, Middlesbrough, Engl

来源：

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

关键词：

D O I：

10.1137/0213003

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

MATHEMATICAL PROGRAMMING, LINEAR

引用

页码：31 / 45

页数：15

共 12 条

[1] DIVIDE AND CONQUER FOR LINEAR EXPECTED TIME [J].

BENTLEY, JL ;

SHAMOS, MI .

INFORMATION PROCESSING LETTERS, 1978, 7 (02) :87-91

[2]

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

[3]

DYER ME, UNPUB MATH OPER RES

[4]

DYER ME, 1981, ON ALGORITHM LOCATIN

[5]

KHACHIYAN LG, 1979, DOKL AKAD NAUK SSSR, P1093

[6]

Muller D. E., 1978, Theoretical Computer Science, V7, P217, DOI 10.1016/0304-3975(78)90051-8

[7]

Preparata F. P., 1979, Theoretical Computer Science, V8, P45, DOI 10.1016/0304-3975(79)90055-0

[8] CONVEX HULLS OF FINITE SETS OF POINTS IN 2 AND 3 DIMENSIONS [J].

PREPARATA, FP ;

HONG, SJ .

COMMUNICATIONS OF THE ACM, 1977, 20 (02) :87-93

[9]

Rockafellar R.T., 1970, CONVEX ANAL

[10]

Shamos Michael Ian, 1976, 17TH P ANN IEEE S F, P208

← 1 2 →