ComputingComputer ScienceAlgorithmsCombinatoricsComputer NetworksDirected Acyclic GraphsGraph TheorySteiner SystemsSteiner Tree ApproximationSteiner Tree ProblemTree Algorithms
Article When trees collide: an approximation algorithm for the generalized Steiner problem on networks Share on Authors: Ajit Agrawal Brown Univ., Providence, RI Brown Univ., Providence, RIView Profile , Philip Klein Brown Univ., Providence, RI Brown Univ., Providence, RIView Profile , R. Ravi Brown Univ., Providence, RI Brown Univ., Providence, RIView Profile Authors Info & Claims STOC '91: Proceedings of the twenty-third annual ACM symposium on Theory of ComputingJanuary 1991 Pages 134–144https://doi.org/10.1145/103418.103437Online:03 January 1991Publication History 47citation861DownloadsMetricsTotal Citations47Total Downloads861Last 12 Months16Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
25
The Complexity of Enumeration and Reliability Problems
Leslie G. Valiant · SIAM Journal on Computing · 1979 · 2.1K citations
A fast algorithm for Steiner trees
Lawrence T. Kou, George Markowsky, L. Berman · Acta Informatica · 1981 · 1.2K citations
Matching, Euler tours and the Chinese postman
Jack Edmonds, Ellis L. Johnson · Mathematical Programming · 1973 · 987 citations
An approximate solution for the Steiner problem in graphs
Haruhisa Takahashi, A Matsuyama · Mathematica japonica · 1980 · 884 citations