New bounds on map labeling with circular labels

Authors:
Minghui Jiang;Sergey Bereg;Zhongping Qin;Binhai Zhu
Affiliations:
Department of Computer Science, Montana State University, Bozeman, MT;Department of Computer Science, University of Texas at Dallas, Richardson, TX;College of Software, Huazhong University of Science and Technology, Wuhan, China;Department of Computer Science, Montana State University, Bozeman, MT
Venue:
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Year:
2004

Citing 8
Cited 7

A packing problem with applications to lettering of maps

SCG '91 Proceedings of the seventh annual symposium on Computational geometry
The problem of compatible representatives

SIAM Journal on Discrete Mathematics
Map labeling and its generalizations

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Point set labeling with specified positions

Proceedings of the sixteenth annual symposium on Computational geometry
Efficient Approximation Algorithms for Multi-label Map Labeling

ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
A Better Lower Bound for Two-Circle Point Labeling

ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
New Algorithms for Two-Label Point Labeling

ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
A simple factor-3 approximation for labeling points with circles

Information Processing Letters

A new approximation algorithm for labeling points with circle pairs

Information Processing Letters
Minimizing movement

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Matching points with rectangles and squares

Computational Geometry: Theory and Applications
Minimizing movement

ACM Transactions on Algorithms (TALG)
Approximation algorithms for free-label maximization

Computational Geometry: Theory and Applications
Two map labeling algorithms for GIS applications

ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I
Approximation algorithms for free-label maximization

SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present new approximation algorithms for the NP-hard problems of labeling points with maximum-size uniform circles and circle pairs (MLUC and MLUCP) Our algorithms build on the important concept of maximal feasible region and new algorithmic techniques We obtain several results: a (2.98 + ε)-approximation for MLUC, improving previous factor 3.0 + ε; a (1.491 + ε)-approximation for MLUCP, improving previous factor 1.5; and the first non-trivial lower bound 1.0349 for both MLUC and MLUCP, improving previous lower bound 1+O(1/n).