Sciweavers

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

23

IPL
2011

favoriteEmaildiscussreport

66views more IPL 2011»

A 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2

13 years 5 months ago

A 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2

Download www.openu.ac.il

Guy Even, Guy Kortsarz, Zeev Nutov

Real-time Traffic

IPL 2011 |

claim paper

Related Content

» An Efficient Graph Cut Algorithm for Computer Vision Problems

» Approximation Schemes for Minimum 2Connected Spanning Subgraphs in Weighted Planar Graphs

» MeshPartitioning with the Multiple AntColony Algorithm

» On the searchability of smallworld networks with arbitrary underlying structure

» Minimizing the Diameter of a Network Using Shortcut Edges

» Spatial Distribution in Routing Table Design for Sensor Networks

» Optimal Routing in a SmallWorld Network

» Autonomous imagebased exploration for mobile robot navigation

Post Info
More Details (n/a)

Added	14 May 2011
Updated	14 May 2011
Type	Journal
Year	2011
Where	IPL
Authors	Guy Even, Guy Kortsarz, Zeev Nutov

Comments (0)