Skip to main content
Springer Nature Link
Log in

Problems with generalized steiner problems

  • Published:
Algorithmica Aims and scope Submit manuscript

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

References

  1. M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.

    MATH  Google Scholar 

  2. K. Takamizawa, T. Nishizeki, and N. Saito, Linear-time computability of combinatorial problems on series-parallel graphs,J. Assoc. Comput. Mach. 29 (1982), 623–641.

    MATH  MathSciNet  Google Scholar 

  3. R. L. Rardin, R. G. Parker, and M. B. Richey, A polynomial algorithm for a class of Steiner tree problems on graphs, Report Series J-82-5, Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA, 1982.

    Google Scholar 

  4. J. A. Wald and C. J. Colbourn, Steiner trees, partial 2-trees and minimum IFI networks,Networks 13 (1983), 159–167.

    Article  MATH  MathSciNet  Google Scholar 

  5. D. S. Johnson, The NP-completeness column: an ongoing guide,J. Algorithms 6 (1985), 434–451.

    Article  MATH  MathSciNet  Google Scholar 

  6. P. Winter, Steiner problem in Halin networks,Discrete Appl. Math. 17 (1987), 281–294.

    Article  MATH  MathSciNet  Google Scholar 

  7. H. L. Bodlaender, Dynamic programming on graphs with bounded treewidth, inAutomata, Languages and Programming (T. Lepisto and A. Salomaa, eds.), Lecture Notes in Computer Science, Vol. 317, Springer-Verlag, Berlin, 1988, pp. 105–118.

    Google Scholar 

  8. K. White, M. Farber, and W. Pulleyblank, Steiner trees, connected domination and strongly chordal graphs,Networks 15 (1985), 109–124.

    Article  MATH  MathSciNet  Google Scholar 

  9. C. J. Colbourn and L. K. Stewart, Permutation graphs: connected domination and Steiner trees, Research Report CS-85-02, University of Waterloo, 1985.

  10. G. Ausiello, A. D'Atri, and M. Moscarini, Chordality properties on graphs and minimal conceptual connections in semantic data models,J. Comput. System Sci. 33 (1986), 179–202.

    Article  MATH  MathSciNet  Google Scholar 

  11. H. Müller and A. Brandstädt, The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs,Theoret. Comput. Sci. 53 (1987), 257–265.

    Article  MATH  MathSciNet  Google Scholar 

  12. A. Brandstädt, The computational complexity of feedback vertex set, hamiltonian circuit, dominating set, Steiner tree, and bandwith on special perfect graphs,J. Inform. Process. Cybernet. EIK 23 (1987), 471–477.

    Google Scholar 

  13. P. Winter, Generalized Steiner problem in outerplanar networks,BIT 25 (1985), 485–496.

    Article  MATH  MathSciNet  Google Scholar 

  14. P. Winter, Generalized Steiner problem in series-parallel networks,J. Algorithms 7 (1986), 549–566.

    Article  MATH  MathSciNet  Google Scholar 

  15. P. Winter, Generalized Steiner problem in Halin networks, Paper presented at 12th International Symposium on Mathematical Programming, Cambridge, 1985.

  16. M. B. Richey and R. G. Parker, On multiple Steiner subgraph problems,Networks 16 (1986), 423–438.

    Article  MATH  MathSciNet  Google Scholar 

  17. S. Voß, Degree constrained Steiner problem, Paper presented at EURO VIII, Lisbon, 1986.

Download references

Author information

Authors and Affiliations

  1. Technische Hochschule Darmstadt, FB 1-FG Operations Research, Hochschulstraße 1, W-6100, Darmstadt, Germany

    Stefan Voß

Authors
  1. Stefan Voß
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by F. K. Hwang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Voß, S. Problems with generalized steiner problems. Algorithmica 7, 333–335 (1992). https://doi.org/10.1007/BF01758767

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation