In this paper, we present an algorithm for placing labels of the points and chains on a map. This algorithm decides several candidates of label positions, which we call label candidates, for each point and chain, and then selects label positions from them. In order to perform flexible labeling for chains, the algorithm first determines the possible positions of one character along each chain and then creates label candidates by generating several combinations of such positions. Furthermore, priorities are assigned to all of the label candidates and are used to avoid confusing label placement. Experimental results show that our algorithm can place more labels for chains than a previous labeling algorithm.