Searching for "Two Variations of the Minimum Steiner Problem." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

Steiner Problems on Directed Acyclic Graphs
by Tsan-Sheng Hsu, Kuo-Hui Tsai, Da-Wei Wang, D. T. Lee — 1995 — Lecture Notes in Computer Science 1090: Proceedings of the 2nd International Symposium on Computing and Combinatorics
… that the above two minimum Steiner problems on directed acyclic graphs are NP-hard by a polynomial transformation…
Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB