## Abstract

We consider the dynamic map labeling problem: given a set of rectangular labels on the map, the goal is to appropriately select visible ranges for all the labels such that no two consistent labels overlap at every scale and the sum of total visible ranges is maximized. This is also called the active range optimization (ARO) problem defined by Been et al. (2006) [2]. We propose approximation algorithms for several variants of this problem. For the simple ARO problem, we provide a 3clogn-approximation algorithm for unit-width rectangular labels if there is a c-approximation algorithm for the unit-width label placement problem in the plane; and a randomized polynomial-time O(lognloglogn)-approximation algorithm for arbitrary rectangular labels. For the general ARO problem, we prove that it remains NP-complete even for congruent square labels with equal selectable scale range. Moreover, we contribute 12-approximation algorithms for both arbitrary square labels and unit-width rectangular labels, and a 6-approximation algorithm for congruent square labels, and show that the bounds are tight.

Original language | English |
---|---|

Pages (from-to) | 84-93 |

Number of pages | 10 |

Journal | Theoretical Computer Science |

Volume | 640 |

DOIs | |

Publication status | Published - 9 Aug 2016 |

Externally published | Yes |

## Keywords

- Active range optimization
- Approximation algorithm
- Dynamic map labeling
- NP-complete

## ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science (all)