Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Diskretnaya Matematika, 1989, Volume 1, Issue 2, Pages 28–37 (Mi dm906)  
Minimal rectilinear Steiner trees

A. F. Sidorenko
Full-text PDF (1218 kB)
Abstract: We consider the problem of constructing a minimal rectilinear Steiner tree for $n$ points on the plane. We prove a number of properties of these trees and describe a fast algorithm for solving this problem for $n\leqslant11$. We give a general solution for $n\leqslant6$.
Received: 28.06.1988
Bibliographic databases:
UDC: 519.172
Language: Russian
Citation: A. F. Sidorenko, “Minimal rectilinear Steiner trees”, Diskr. Mat., 1:2 (1989), 28–37
Citation in format AMSBIB
\Bibitem{Sid89}
\by A.~F.~Sidorenko
\paper Minimal rectilinear Steiner trees
\jour Diskr. Mat.
\yr 1989
\vol 1
\issue 2
\pages 28--37
\mathnet{http://mi.mathnet.ru/dm906}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1035091}
\zmath{https://zbmath.org/?q=an:0747.05033}
Linking options:
  • https://www.mathnet.ru/eng/dm906
  • https://www.mathnet.ru/eng/dm/v1/i2/p28
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:561
    Full-text PDF :297
    References:1
    First page:2
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025