We consider the problem of placing labels of the points

\r\non a plane. For each point, its position, the size of its label and a

\r\npriority are given. Moreover, several candidates of its label positions

\r\nare prespecified, and each of such label positions is assigned a

\r\npriority. The objective of our problem is to maximize the total sum

\r\nof priorities of placed labels and their points. By refining a labeling

\r\nalgorithm that can use these priorities, we propose a new heuristic

\r\nalgorithm which is more suitable for treating the assigned priorities.<\/p>\r\n","references":"[1] A. Wolff, The Map-Labeling Bibliography,\r\nhttp:\/\/i11www.ira.uka.de\/map-labeling\/bibliography\/.\r\n[2] F. Wagner and A. Wolff, \"A combinatorial framework for map labeling\r\nproblem,\u201d Proc. 6th Int\u2019l Symp. Graph Drawing (GD\u201998), Lecture Notes\r\nin Computer Sciences, Volume.1547, pp.316-331, Springer, Berlin, 1998.\r\n[3] F. Wagner, A. Wolff, V. Kapoor and T. Strijk, \"Three rules suffice for good\r\nlabel placement,\u201d Algorithmica, Volume 30, No.2, pp.334-349, 2001.\r\n[4] K. Funakawa, N. Abe, K. Yamaguchi and S. Masuda, \"Algorithms for\r\nthe map labeling problem with priorities\u201d (in Japanese), IEICE Trans.\r\nFundamentals, Volume J88-A, No.5, pp.677-681, 2005.\r\n[5] N. Abe, M. Kusaki, S. Masuda and K. Yamaguchi, \"An algorithm for\r\nplacing labels of the points and chains on a map,\u201d International Journal\r\nof Information Science and Computer Mathematics, Volume 4, Issue 2,\r\npp.79-99, 2011.","publisher":"World Academy of Science, Engineering and Technology","index":"Open Science Index 89, 2014"}