Discrete Isoperimetric Problems
暂无分享,去创建一个
It is shown that there exists a linear ordering of the points in $I_ + ^n $ or $I^n $ (Cartesian products of nonnegative integers or integers) such that the first j points in this ordering is a configuration that minimizes the number of boundary points (points not in the set that have Euclidean distance one from the set) among sets of size j. The relation of the $I_ + ^n $ result to Macaulay’s theorem is deduced also.
[1] B. Lindström,et al. A Generalization of a Combinatorial Theorem of Macaulay , 1969 .
[2] Ronald L. Rivest,et al. On the Optimality of Elia's Algorithm for Performing Best-Match Searches , 1974, IFIP Congress.