ON THE COMPLEXITY OF POLYHEDRAL SEPARABILITY

被引:84
作者
MEGIDDO, N [1 ]
机构
[1] TEL AVIV UNIV,IL-69978 TEL AVIV,ISRAEL
关键词
D O I
10.1007/BF02187916
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:325 / 337
页数:13
相关论文
共 8 条
[1]  
BLUMER A, 1986, 18TH P ACM S THEOR C, P273
[2]  
EDELSBRUNNER H, 1986, UIUCDCSR861272 U ILL
[3]  
Kim C. E., 1984, 16 ANN ACM S THEOR C, P117
[4]   LINEAR-TIME ALGORITHMS FOR LINEAR-PROGRAMMING IN R3 AND RELATED PROBLEMS [J].
MEGIDDO, N .
SIAM JOURNAL ON COMPUTING, 1983, 12 (04) :759-776
[5]   LINEAR-PROGRAMMING IN LINEAR TIME WHEN THE DIMENSION IS FIXED [J].
MEGIDDO, N .
JOURNAL OF THE ACM, 1984, 31 (01) :114-127
[6]  
Megiddo N., 1982, Operations Research Letters, V1, P194, DOI 10.1016/0167-6377(82)90039-6
[7]   COMPUTING CIRCULAR SEPARABILITY [J].
OROURKE, J ;
KOSARAJU, SR ;
MEGIDDO, N .
DISCRETE & COMPUTATIONAL GEOMETRY, 1986, 1 (02) :105-113
[8]  
[No title captured]