Skip to main content
SpringerLink
Log in

Subclass of the Steiner problems on a plane with rectilinear metric

  • Published:
Cybernetics Aims and scope

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Literature Cited

  1. M. R. Garey and D. S. Johnson, “The rectilinear Steiner tree problem is NP-complete,” SIAM J. Appl. Math.,32, No. 4, 826–834 (1977).

    Google Scholar 

  2. E. Mainika, Optimization Algorithms on Networks and Graphs [Russian translation], Mir, Moscow (1981).

    Google Scholar 

  3. V. A. Trubin, Properties and Methods of Solution of Optimum Network Synthesis Problems [in Russian], Znanie, Kiev (1982).

    Google Scholar 

  4. T. C. Hu, Integer Programming and Network Flows, Addison-Wesley (1969).

Download references

Authors
  1. V. A. Trubin
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 3, pp. 37–40, May–June, 1985.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Trubin, V.A. Subclass of the Steiner problems on a plane with rectilinear metric. Cybern Syst Anal 21, 320–324 (1985). https://doi.org/10.1007/BF01078826

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01078826

Keywords

Search

Navigation