Approximating the smallest k-edge connected spanning subgraph by LP-rounding
Article first published online: 17 DEC 2008
Copyright © 2008 Wiley Periodicals, Inc.
Volume 53, Issue 4, pages 345–357, July 2009
How to Cite
Gabow, H. N., Goemans, M. X., Tardos, É. and Williamson, D. P. (2009), Approximating the smallest k-edge connected spanning subgraph by LP-rounding. Networks, 53: 345–357. doi: 10.1002/net.20289
- Issue published online: 24 APR 2009
- Article first published online: 17 DEC 2008
- Manuscript Accepted: JUL 2008
- Manuscript Received: JUL 2007
- NSF. Grant Number: CCR-0098018
- ONR. Grant Number: N00014-98-1-0589
Options for accessing this content:
- If you have access to this content through a society membership, please first log in to your society website.
- If you would like institutional access to this content, please recommend the title to your librarian.
- Login via other institutional login options http://onlinelibrary.wiley.com/login-options.
- You can purchase online access to this Article for a 24-hour period (price varies by title)
- New Users: Please register, then proceed to purchase the article.
Registered Users please login:
- Access your saved publications, articles and searches
- Manage your email alerts, orders and subscriptions
- Change your contact information, including your password
Please register to:
- Save publications, articles and searches
- Get email alerts
- Get all the benefits mentioned below!