Algorithmic aspects of distance constrained labeling: a survey
-
- Hasunuma Toru
- The University of Tokushima
-
- Ishii Toshimasa
- Hokkaido University
-
- Ono Hirotaka
- Kyushu University
-
- Uno Yushi
- Osaka Prefecture University
Search this article
Abstract
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.
Journal
-
- International Journal of Networking and Computing
-
International Journal of Networking and Computing 4 (2), 251-259, 2014
IJNC Editorial Committee
