期刊名称：International Journal of Networking and Computing
印刷版ISSN：2185-2847
出版年度：2014
卷号：4
期号：2
页码：251-259
语种：English
出版社：International Journal of Networking and Computing
摘要：Distance constrained labeling problems, e.g., L(p,q)-labeling and (p,q)-total labeling, are originally motivated by the frequency assignment. From the viewpoint of theory, the upper bounds on the labeling numbers and the time complexity of finding a minimum labeling are intensively and extensively studied. In this paper, we survey the distance constrained labeling problems from algorithmic aspects, that is, computational complexity, approximability, exact computation, and so on.Â
关键词：distance constrained labeling; L(2; 1)-labeling; (2; 1)-total labeling; frequency assignment
