Skip to main content
SpringerLink
Log in
Book cover

International Computing and Combinatorics Conference

COCOON 1996: Computing and Combinatorics pp 21–30Cite as

Steiner problems on directed acyclic graphs

  • Session 1
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1090))

Abstract

Two variations of the minimum-cost Steiner problem on a directed acyclic graph with non-negative weights edges are studied.

Supported in part by National Science Council, Taiwan, ROC, under the Grant No. NSC-83-0408-E-001-021.

Supported in part by the National Science Foundation under the Grants CCR-9309743 and INT-9207212, and by the Office of Naval Research under the Grant No. N00014-93-1-0272.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Y. P. Aneja. An integer linear programming approach to the Steiner problem in graphs. Networks, 10:167–178, 1980.

    Google Scholar 

  2. G. Dahl. Directed Steiner problems with connectivity constraints. Discrete Applied Math., 47:109–128, 1993.

    Google Scholar 

  3. S. E. Dreyfus and R. A. Wagner. The Steiner problem in graphs. Networks, 1:195–207, 1972.

    Google Scholar 

  4. M. L. Fredman and R. E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM, 34(3):596–615, 1987.

    Article  Google Scholar 

  5. H. N. Gabow, Z. Galil, T. Spencer, and R. E. Tarjan. Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Combinatorica, 6(2):109–122, 1986.

    Google Scholar 

  6. S. L. Hakimi. Steiner's problem in graphs and its applications. Networks, 1:113–133, 1971.

    Google Scholar 

  7. F. K. Hwang and D. S. Richards. Steiner tree problems. Networks, 22:55–89, 1992.

    Google Scholar 

  8. F. K. Hwang, D. S. Richards, and P. Winter. The Steiner Tree Problem. Annals of Discrete mathematics 53. North-Holland, 1992.

    Google Scholar 

  9. E. L. Lawler. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart, and Winston, New York, 1976.

    Google Scholar 

  10. S. Martello and P. Toth. Finding a minimum equivalent graph of a digraph. Networks, 12:89–100, 1982.

    Google Scholar 

  11. L. Nastansky, S. M. Selkow, and N. F. Stewart. Cost-minimal trees in directed acyclic graphs. Zeitschrift für Operations Research, pages 59–67, 1974.

    Google Scholar 

  12. S. K. Rao, P. Sadayappan, F. K. Hwang, and P. W. Shor. The rectilinear Steiner arborescence problem. Algorithmica, pages 277–288, 1992.

    Google Scholar 

  13. R. E. Tarjan. Data Structures and Network Algorithms. SIAM Press, Philadelphia, PA, 1983.

    Google Scholar 

  14. S. Voss. Worst-case performance of some heuristics for Steiner's problem in directed graphs. Information Processing Letters, 48:99–105, 1993.

    Google Scholar 

  15. P. Winter. Steiner problem in networks: A survey. Networks, 17:129–167, 1987.

    Google Scholar 

  16. R. T. Wong. A dual ascent approach for Steiner tree problems on a directed graphs. Math. Programming, 28:271–287, 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Information Science, Academia Sinica, Nankang 11529, Taipei, Taiwan, ROC

    Tsan-sheng Hsu, Ku-Hui Tsai & Da-Wei Wang

  2. Department of Electrical Engineering and Computer Science, Northwestern University, 60208, Evanston, IL, USA

    D. T. Lee

Authors
  1. Tsan-sheng Hsu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ku-Hui Tsai
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Da-Wei Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. D. T. Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jin-Yi Cai Chak Kuen Wong

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hsu, Ts., Tsai, KH., Wang, DW., Lee, D.T. (1996). Steiner problems on directed acyclic graphs. In: Cai, JY., Wong, C.K. (eds) Computing and Combinatorics. COCOON 1996. Lecture Notes in Computer Science, vol 1090. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61332-3_135

Download citation

  • DOI: https://doi.org/10.1007/3-540-61332-3_135

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61332-9

  • Online ISBN: 978-3-540-68461-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation