DIAMETER PARTITIONING

被引：33

作者：

AVIS, D

机构：

来源：

关键词：

D O I：

10.1007/BF02187699

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：265 / 276

页数：12

共 17 条

[1]

Aho A. V., 1974, The design and analysis of computer algorithms

[2] NON-PARTITIONABLE POINT SETS [J].

AVIS, D .

[3]

AVIS D, IN PRESS ALGORITHMS

[4]

AVIS D, 1985, MAY P INT C F DAT OR, P154

[5]

Dobkin D. P., 1984, 25th Annual Symposium on Foundations of Computer Science (Cat. No. 84CH2085-9), P387, DOI 10.1109/SFCS.1984.715939

[6] ON THE NUMBER OF LINE SEPARATIONS OF A FINITE-SET IN THE PLANE [J].

EDELSBRUNNER, H ;

WELZL, E .

[7]

EDELSBRUNNER H, 1982, BIT, V22, P274, DOI 10.1007/BF01934440

[8]

Erdos P., 1973, Survey of Combinatorial Theory, P139

[9] OPTIMAL PACKING AND COVERING IN THE PLANE ARE NP-COMPLETE [J].

FOWLER, RJ ;

PATERSON, MS ;

TANIMOTO, SL .

[10]

Garey M. R., 1979, Computers and Intractability: A Guide to the Theory of np-Completeness, DOI DOI 10.1109/TEST.1990.114069