Network design for vertex connectivity

doi:10.1145/1374376.1374403

Network design for vertex connectivity

Full Text:

PDF

Buy this Article

Authors:	Tanmoy Chakraborty	University of Pennsylvania, Philadelphia, PA, USA
	Julia Chuzhoy	Toyota Technological Institute, Chicago, IL, USA
	Sanjeev Khanna	University of Pennsylvania, Philadelphia, PA, USA

Published in:

	· Proceeding
	STOC '08 Proceedings of the 40th annual ACM symposium on Theory of computing
	Pages 167-176 ACM New York, NY, USA ©2008 table of contents ISBN: 978-1-60558-047-0 doi>10.1145/1374376.1374403

	2008 Article
Bibliometrics
· Downloads (6 Weeks): 2 · Downloads (12 Months): 27 · Downloads (cumulative): 312 · Citation Count: 14

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref
Upcoming Conference:
- STOC'13

Share:

|

Tags: algorithms approximation algorithms computations on discrete structures hardness of approximation network design theory vertex connectivity

Feedback | Switch to single page view (no tabs)

**Javascript is not enabled and is required for the "tabbed view" or switch to the single page view**

Powered by

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player

The ACM Guide to Computing Literature

All Tags

Export Formats

Save to Binder