Searching for "On the Inapproximability of Disjoint Paths and Minimum Steiner Forest with Bandwidth Constraints." – 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.

On the inapproximability of disjoint paths and minimum steiner forest with bandwidth constraints
by Bin Ma, Lusheng Wang — Journal of Computer and Systems Sciences
… Steiner forest with bandwidth constraints. Maximum Disjoint Paths Given a graph G=(V, E ) and a set…
Cited by 9 (1 self) – Add To MetaCart

Showing 1 through 1.

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