Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

89

Voted

JCSS
2000

44views more JCSS 2000»

On the Inapproximability of Disjoint Paths and Minimum Steiner Forest with Bandwidth Constraints

15 years 2 months ago

On the Inapproximability of Disjoint Paths and Minimum Steiner Forest with Bandwidth Constraints

Download www.cs.cityu.edu.hk

Bin Ma, Lusheng Wang

Real-time Traffic

JCSS 2000 |

claim paper

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2000
Where	JCSS
Authors	Bin Ma, Lusheng Wang

Comments (0)