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 to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Y. P. Aneja. An integer linear programming approach to the Steiner problem in graphs. Networks, 10:167–178, 1980.
G. Dahl. Directed Steiner problems with connectivity constraints. Discrete Applied Math., 47:109–128, 1993.
S. E. Dreyfus and R. A. Wagner. The Steiner problem in graphs. Networks, 1:195–207, 1972.
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.
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.
S. L. Hakimi. Steiner's problem in graphs and its applications. Networks, 1:113–133, 1971.
F. K. Hwang and D. S. Richards. Steiner tree problems. Networks, 22:55–89, 1992.
F. K. Hwang, D. S. Richards, and P. Winter. The Steiner Tree Problem. Annals of Discrete mathematics 53. North-Holland, 1992.
E. L. Lawler. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart, and Winston, New York, 1976.
S. Martello and P. Toth. Finding a minimum equivalent graph of a digraph. Networks, 12:89–100, 1982.
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.
S. K. Rao, P. Sadayappan, F. K. Hwang, and P. W. Shor. The rectilinear Steiner arborescence problem. Algorithmica, pages 277–288, 1992.
R. E. Tarjan. Data Structures and Network Algorithms. SIAM Press, Philadelphia, PA, 1983.
S. Voss. Worst-case performance of some heuristics for Steiner's problem in directed graphs. Information Processing Letters, 48:99–105, 1993.
P. Winter. Steiner problem in networks: A survey. Networks, 17:129–167, 1987.
R. T. Wong. A dual ascent approach for Steiner tree problems on a directed graphs. Math. Programming, 28:271–287, 1984.
Author information
Authors and Affiliations
Editor information
Rights 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