Efficient Algorithms for Euclidean Steiner Minimal Tree on Near-Convex Terminal Sets

Authors Anubhav Dhar, Soumita Hait, Sudeshna Kolay

Thumbnail PDF


  • Filesize: 1.07 MB
  • 17 pages

Document Identifiers

Author Details

Anubhav Dhar
  • Indian Institute of Technology Kharagpur, India
Soumita Hait
  • Indian Institute of Technology Kharagpur, India
Sudeshna Kolay
  • Indian Institute of Technology Kharagpur, India

Cite AsGet BibTex

Anubhav Dhar, Soumita Hait, and Sudeshna Kolay. Efficient Algorithms for Euclidean Steiner Minimal Tree on Near-Convex Terminal Sets. In 34th International Symposium on Algorithms and Computation (ISAAC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 283, pp. 25:1-25:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)


The Euclidean Steiner Minimal Tree problem takes as input a set P of points in the Euclidean plane and finds the minimum length network interconnecting all the points of P. In this paper, in continuation to the works of [Du et al., 1987] and [Weng and Booth, 1995], we study Euclidean Steiner Minimal Tree when P is formed by the vertices of a pair of regular, concentric and parallel n-gons. We restrict our attention to the cases where the two polygons are not very close to each other. In such cases, we show that Euclidean Steiner Minimal Tree is polynomial-time solvable, and we describe an explicit structure of a Euclidean Steiner minimal tree for P. We also consider point sets P of size n where the number of input points not on the convex hull of P is f(n) ≤ n. We give an exact algorithm with running time 2^𝒪(f(n) log n) for such input point sets P. Note that when f(n) = 𝒪(n/(log n)), our algorithm runs in single-exponential time, and when f(n) = o(n) the running time is 2^o(n log n) which is better than the known algorithm in [Hwang et al., 1992]. We know that no FPTAS exists for Euclidean Steiner Minimal Tree unless P = NP [Garey et al., 1977]. On the other hand FPTASes exist for Euclidean Steiner Minimal Tree on convex point sets [Scott Provan, 1988]. In this paper, we show that if the number of input points in P not belonging to the convex hull of P is 𝒪(log n), then an FPTAS exists for Euclidean Steiner Minimal Tree. In contrast, we show that for any ε ∈ (0,1], when there are Ω(n^ε) points not belonging to the convex hull of the input set, then no FPTAS can exist for Euclidean Steiner Minimal Tree unless P = NP.

Subject Classification

ACM Subject Classification
  • Theory of computation → Computational geometry
  • Steiner minimal tree
  • Euclidean Geometry
  • Almost Convex point sets
  • strong NP-completeness


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Sanjeev Arora. Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. Journal of the ACM (JACM), 45(5):753-782, 1998. Google Scholar
  2. Marcus Brazil, Ronald L Graham, Doreen A Thomas, and Martin Zachariasen. On the history of the Euclidean Steiner tree problem. Archive for history of exact sciences, 68(3):327-354, 2014. Google Scholar
  3. EJ Cockayne. On the Steiner problem. Canadian Mathematical Bulletin, 10(3):431-450, 1967. Google Scholar
  4. Stuart E Dreyfus and Robert A Wagner. The Steiner problem in graphs. Networks, 1(3):195-207, 1971. Google Scholar
  5. Ding-Zhu Du, Frank K. Hwang, and JF Weng. Steiner minimal trees for regular polygons. Discrete & Computational Geometry, 2(1):65-84, 1987. Google Scholar
  6. Michael R Garey, Ronald L Graham, and David S Johnson. The complexity of computing Steiner minimal trees. SIAM Journal on Applied Mathematics, 32(4):835-859, 1977. Google Scholar
  7. Michael R Garey and David S Johnson. Computers and intractability, volume 174. freeman San Francisco, 1979. Google Scholar
  8. FK Hwang. A linear time algorithm for full Steiner trees. Operations Research Letters, 4(5):235-237, 1986. Google Scholar
  9. FK Hwang, DS Richards, and P Winter. The Steiner tree problem. Annals of Discrete Mathematics series, vol. 53, 1992. Google Scholar
  10. Sándor Kisfaludi-Bak, Jesper Nederlof, and Karol Węgrzycki. A gap-ETH-tight approximation scheme for Euclidean TSP. In 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), pages 351-362. IEEE, 2022. Google Scholar
  11. Zdzislaw Alexander Melzak. On the problem of Steiner. Canadian Mathematical Bulletin, 4(2):143-148, 1961. Google Scholar
  12. Satish B Rao and Warren D Smith. Approximating geometrical graphs via “spanners” and “banyans”. In Proceedings of the thirtieth annual ACM symposium on Theory of computing, pages 540-550, 1998. Google Scholar
  13. J Hyam Rubinstein, Doreen A Thomas, and Nicholas C Wormald. Steiner trees for terminals constrained to curves. SIAM Journal on Discrete Mathematics, 10(1):1-17, 1997. Google Scholar
  14. J Scott Provan. Convexity and the Steiner tree problem. Networks, 18(1):55-72, 1988. Google Scholar
  15. Jia Feng Weng and Raymond Sydney Booth. Steiner minimal trees on regular polygons with centre. Discrete Mathematics, 141(1-3):259-274, 1995. Google Scholar
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail