IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-319-24971-1_4.html
   My bibliography  Save this book chapter

Generalized Hanan Grids for Geometric Steiner Trees in Uniform Orientation Metrics

In: Gems of Combinatorial Optimization and Graph Algorithms

Author

Listed:
  • Matthias Müller-Hannemann

    (Martin-Luther-Universität Halle-Wittenberg, Institut für Informatik)

Abstract

Given a finite set of points in some metric space, a fundamental task is to find a shortest network interconnecting all of them. The network may include additional points, so-called Steiner points, which can be inserted at arbitrary places in order to minimize the total length with respect to the given metric. This paper focuses on uniform orientation metrics where the edges of the network are restricted to lie within a given set of legal directions. We here review the crucial insight that many versions of geometric network design problems can be reduced to the Steiner tree problem in finite graphs, namely the Hanan grid or its extensions.

Suggested Citation

  • Matthias Müller-Hannemann, 2015. "Generalized Hanan Grids for Geometric Steiner Trees in Uniform Orientation Metrics," Springer Books, in: Andreas S. Schulz & Martin Skutella & Sebastian Stiller & Dorothea Wagner (ed.), Gems of Combinatorial Optimization and Graph Algorithms, pages 37-47, Springer.
    • Handle: RePEc:spr:sprchp:978-3-319-24971-1_4
    DOI: 10.1007/978-3-319-24971-1_4
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:sprchp:978-3-319-24971-1_4. 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.