Sciweavers

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

62

Voted

JCSS
2006

favoriteEmaildiscussreport

40views more JCSS 2006»

Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems

15 years 16 days ago

Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems

Download www.cs.dartmouth.edu

Lisa Fleischer, Kamal Jain, David P. Williamson

Real-time Traffic

JCSS 2006 |

claim paper

Related Content

» Algorithms for SingleSource Vertex Connectivity

» Approximating minimum bounded degree spanning trees to within one of optimal

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2006
Where	JCSS
Authors	Lisa Fleischer, Kamal Jain, David P. Williamson

Comments (0)