Constant factor approximation of vertex-cuts in planar graphs

Eyal Amir, Robert Krauthgamer, Satish Rao. Constant factor approximation of vertex-cuts in planar graphs. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA. pages 90-99, ACM, 2003. [doi]

Authors

Eyal Amir

This author has not been identified. Look up 'Eyal Amir' in Google

Robert Krauthgamer

This author has not been identified. Look up 'Robert Krauthgamer' in Google

Satish Rao

This author has not been identified. Look up 'Satish Rao' in Google