On Some Proximity Problems of Colored Sets
点击次数：
第一作者：Cheng-Lin Fan
发表时间：2014-01-01
发表刊物：Journal of Computer Science and Technology
所属单位：数理与信息工程学院
文献类型：期刊
卷号：Vol.29
期号：No.5
页面范围：879-886
ISSN号：1000-9000;1860-4749
关键字：computational;geometry;colored;set;algorithm;maximum;diameter;color-spanning;set;problem
摘要：The maximum diameter color-spanning set problem (MaxDCS) is defined as follows: given n points with m colors, select m points with m distinct colors such that the diameter of the set of chosen points is maximized. In this paper, we design an optimal O(n l
是否译文：否