IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v44y2022i4d10.1007_s10878-021-00796-0.html
   My bibliography  Save this article

1-line minimum rectilinear steiner trees and related problems

Author

Listed:
  • Jianping Li

    (Yunnan University)

  • Junran Lichen

    (Institute of Applied Mathematics, Academy of Mathematics and Systems Science, Chinese Academy of Sciences)

  • Wencheng Wang

    (Yunnan University)

  • Jean Yeh

    (Department of Mathematics, National Kaohsiung Normal University)

  • YeongNan Yeh

    (Institute of Mathematics, Academia Sinica)

  • Xingxing Yu

    (School of Mathematics, Georgia Institute of Technology)

  • Yujie Zheng

    (Yunnan University)

Abstract

In this paper, motivated by many practical applications, we address the 1-line minimum rectilinear Steiner tree (1L-MRStT) problem, which is a variation of the Euclidean minimum rectilinear Steiner tree problem. More specifically, given n points in the Euclidean plane $${\mathbb {R}}^2$$ R 2 , it is asked to find the location of a line l and a Steiner tree T(l), consisting only of vertical and horizontal line segments plus several successive segments located on this line l, to interconnect these n points and at least one point located on the line l, the objective is to minimize total weight of this Steiner tree T(l), i.e., $$\min \{\sum _{uv\in T(l)} w(u,v)$$ min { ∑ u v ∈ T ( l ) w ( u , v ) | T(l) is a Steiner tree mentioned-above $$\}$$ } , where we define a weight $$w(u,v)=0$$ w ( u , v ) = 0 if the two endpoints u and v of that edge $$uv \in T(l)$$ u v ∈ T ( l ) is located on the line l and otherwise we define a weight w(u, v) as the rectilinear distance between the two endpoints u and v of that edge $$uv \in T(l)$$ u v ∈ T ( l ) . Given a line l as an input in $${\mathbb {R}}^2$$ R 2 , we denote this problem as the 1-line-fixed minimum rectilinear Steiner tree (1LF-MRStT) problem; Furthermore, when the Steiner points of T(l) are all located on the fixed line l, we recall this problem as the 1-line-fixed-constrained minimum rectilinear Steiner tree (1LFC-MRStT) problem. We provide three following main contributions. (1) We design an algorithm $${{\mathcal {A}}}_{C}$$ A C to optimally solve the 1LFC-MRStT problem, where the algorithm $${{\mathcal {A}}}_{C}$$ A C runs in time $$O(n\log n)$$ O ( n log n ) ; (2) We prove that this algorithm $${{\mathcal {A}}}_{C}$$ A C is a 1.5-approximation algorithm to solve the 1LF-MRStT problem; (3) Combining the algorithm $${{\mathcal {A}}}_{C}$$ A C for many times and a key lemma proved by some techniques of computational geometry, we present a 1.5-approximation algorithm to solve the 1L-MRStT problem, where this algorithm runs in time $$O(n^3\log n)$$ O ( n 3 log n ) , and we finally provide another approximation algorithm to solve a special version of the 1L-MRStT problem, where that new algorithm runs in lower time $$O(n^2\log n)$$ O ( n 2 log n ) .

Suggested Citation

  • Jianping Li & Junran Lichen & Wencheng Wang & Jean Yeh & YeongNan Yeh & Xingxing Yu & Yujie Zheng, 2022. "1-line minimum rectilinear steiner trees and related problems," Journal of Combinatorial Optimization, Springer, vol. 44(4), pages 2832-2852, November.
  • Handle: RePEc:spr:jcomop:v:44:y:2022:i:4:d:10.1007_s10878-021-00796-0
    DOI: 10.1007/s10878-021-00796-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-021-00796-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10878-021-00796-0?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.

    References listed on IDEAS

    as
    1. James G. Morris & John P. Norback, 1980. "A Simple Approach to Linear Facility Location," Transportation Science, INFORMS, vol. 14(1), pages 1-8, February.
    2. Jianping Li & Suding Liu & Junran Lichen & Wencheng Wang & Yujie Zheng, 2020. "Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem," Journal of Combinatorial Optimization, Springer, vol. 39(2), pages 492-508, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Jianping Li & Suding Liu & Junran Lichen & Wencheng Wang & Yujie Zheng, 2020. "Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem," Journal of Combinatorial Optimization, Springer, vol. 39(2), pages 492-508, February.
    2. Jack Brimberg & Robert Schieweck & Anita Schöbel, 2015. "Locating a median line with partial coverage distance," Journal of Global Optimization, Springer, vol. 62(2), pages 371-389, June.
    3. Schobel, Anita, 1998. "Locating least-distant lines in the plane," European Journal of Operational Research, Elsevier, vol. 106(1), pages 152-159, April.
    4. Diaz-Banez, J.M. & Ramos, P.A. & Sabariego, P., 2007. "The maximin line problem with regional demand," European Journal of Operational Research, Elsevier, vol. 181(1), pages 20-29, August.
    5. Diaz-Banez, J. M. & Mesa, J. A. & Schobel, A., 2004. "Continuous location of dimensional structures," European Journal of Operational Research, Elsevier, vol. 152(1), pages 22-44, January.
    6. Prosenjit Bose & Anthony D’Angelo & Stephane Durocher, 2022. "On the restricted k-Steiner tree problem," Journal of Combinatorial Optimization, Springer, vol. 44(4), pages 2893-2918, November.
    7. Alessandro Agnetis & Pitu B. Mirchandani & Andrea Pacifici, 2002. "Partitioning of biweighted trees," Naval Research Logistics (NRL), John Wiley & Sons, vol. 49(2), pages 143-158, March.
    8. Jack Brimberg & Henrik Juel & Anita Schöbel, 2007. "Locating a Circle on a Sphere," Operations Research, INFORMS, vol. 55(4), pages 782-791, August.
    9. Jack Brimberg & Henrik Juel & Anita Schöbel, 2002. "Linear Facility Location in Three Dimensions---Models and Solution Methods," Operations Research, INFORMS, vol. 50(6), pages 1050-1057, December.
    10. Blanquero, Rafael & Carrizosa, Emilio & Schöbel, Anita & Scholz, Daniel, 2011. "A global optimization procedure for the location of a median line in the three-dimensional space," European Journal of Operational Research, Elsevier, vol. 215(1), pages 14-20, November.

    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:44:y:2022:i:4:d:10.1007_s10878-021-00796-0. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.