Sciweavers

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

30

JCSS
2008

favoriteEmaildiscussreport

64views more JCSS 2008»

Tight approximation algorithm for connectivity augmentation problems

13 years 11 months ago

Tight approximation algorithm for connectivity augmentation problems

Download www.openu.ac.il

Guy Kortsarz, Zeev Nutov

Real-time Traffic

JCSS 2008 |

claim paper

Related Content

» Approximating NodeConnectivity Augmentation Problems

» Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum kWay Cut...

» Tight results for Next Fit and Worst Fit with resource augmentation

» Free Bits PCPs and NonApproximability Towards Tight Results

» Approximation Algorithms for Forests Augmentation Ensuring Two Disjoint Paths of Bounded L...

» Kernelization and Complexity Results for Connectivity Augmentation Problems

» Free Bits PCPs and NonapproximabilityTowards Tight Results

» Approximating Rooted Connectivity Augmentation Problems

» Nature Reserve Selection Problem A Tight Approximation Algorithm

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2008
Where	JCSS
Authors	Guy Kortsarz, Zeev Nutov

Comments (0)