IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v6y2002i1d10.1023_a1013326409918.html
   My bibliography  Save this article

New Approximation Algorithms for Map Labeling with Sliding Labels

Author

Listed:
  • Binhai Zhu

    (Montana State University)

  • Z.P. Qin

    (Huazhong University of Science and Technology)

Abstract

In this paper we present approximation algorithm for the following NP-hard map labeling problem: Given a set S of n distinct sites in the plane, one needs to place at each site a uniform square of maximum possible size such that all the squares are along the same direction. This generalizes the classical problem of labeling points with axis-parallel squares and restricts the most general version where the squares can have different orientations. We obtain factor-4 and factor- $$5\sqrt 2 $$ approximation algorithms for this problem. These algorithms also work for two generalized versions of the problem. We also revisit the problem of labeling each point with maximum uniform axis-parallel square pairs and improve the previous approximation factor of 4 to 3.

Suggested Citation

  • Binhai Zhu & Z.P. Qin, 2002. "New Approximation Algorithms for Map Labeling with Sliding Labels," Journal of Combinatorial Optimization, Springer, vol. 6(1), pages 99-110, March.
    • Handle: RePEc:spr:jcomop:v:6:y:2002:i:1:d:10.1023_a:1013326409918
    DOI: 10.1023/A:1013326409918
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1013326409918
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1013326409918?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Binhai Zhu & Minghui Jiang, 2006. "A combinatorial theorem on labeling squares with points and its application," Journal of Combinatorial Optimization, Springer, vol. 11(4), pages 411-420, June.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:6:y:2002:i:1:d:10.1023_a:1013326409918. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.