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).
This research is partially supported by NSF CARGO grant DMS-0138065.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bereg, S.: Private communication (2004)
Doddi, S., Marathe, M.V., Mirzaian, A., Moret, B.M.E., Zhu, B.: Map labeling and its generalizations. In: Proc. 8th ACM-SIAM Symposium on Discrete Algorithms (SODA 1997), pp. 148–157 (1997)
Doddi, S., Marathe, M.V., Moret, B.M.E.: Point set labeling with specified positions. In: Proc. 16th Annual ACM Symposium on Computational Geometry (SoCG 2000),
Formann, M., Wagner, F.: A packing problem with application to lettering of maps. In: Proc. 7th Annual ACM Symposium on Computational Geometry (SoCG 1991), pp. 281–288 (1991)
Jiang, M., Qian, J., Qin, Z., Zhu, B., Cimikowski, R.: A simple factor-3 approximation for labeling points with circles. Information Processing Letters 87(2), 101–105 (2003)
Knuth, D.E., Raghunathan, A.: The problem of compatible representatives. SIAM Journal on Discrete Mathematics 5(3), 422–427 (1992)
Lichtenstein, D.: Planar formulae and their uses. SIAM Journal on Computing 11(2), 329–343 (1982)
Qin, Z., Wolff, A., Xu, Y., Zhu, B.: New algorithms for two-label point labeling. In: Paterson, M. (ed.) ESA 2000. LNCS, vol. 1879, pp. 368–380. Springer, Heidelberg (2000)
Spriggs, M.J., Keil, J.M.: A new bound for map labeling with uniform circle pairs. Information Processing Letters 81(1), 47–53 (2002)
Strijk, T., Wolff, A.: Labeling points with circles. International Journal of Computational Geometry & Applications 11(2), 181–195 (2001)
Wolff, A., Thon, M.R., Xu, Y.: A better lower bound for two-circle point labeling. In: Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol. 1969, pp. 422–431. Springer, Heidelberg (2000)
Zhu, B., Poon, C.K.: Efficient approximation algorithms for multi-label map labeling. In: Aggarwal, A.K., Pandu Rangan, C. (eds.) ISAAC 1999. LNCS, vol. 1741, pp. 143–152. Springer, Heidelberg (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jiang, M., Bereg, S., Qin, Z., Zhu, B. (2004). New Bounds on Map Labeling with Circular Labels. In: Fleischer, R., Trippen, G. (eds) Algorithms and Computation. ISAAC 2004. Lecture Notes in Computer Science, vol 3341. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30551-4_53
Download citation
DOI: https://doi.org/10.1007/978-3-540-30551-4_53
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24131-7
Online ISBN: 978-3-540-30551-4
eBook Packages: Computer ScienceComputer Science (R0)