Sciweavers

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

64

STOC
2004
ACM

favoriteEmaildiscussreport

104views Algorithms» more STOC 2004»

Approximation algorithm for k-node connected subgraphs via critical graphs

15 years 11 months ago

Approximation algorithm for k-node connected subgraphs via critical graphs

Download crab.rutgers.edu

Guy Kortsarz, Zeev Nutov

Real-time Traffic

Algorithms | K-node Connected Subgraphs | STOC 2004 |

claim paper

Related Content

» Approximating node connectivity problems via set covers

» Common visual pattern discovery via spatially coherent correspondences

» Local methods for estimating pagerank values

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2004
Where	STOC
Authors	Guy Kortsarz, Zeev Nutov

Comments (0)