SIGN IN
SIGN UP
Online and stochastic survivable network design
Full Text:
PDF
Buy this Article
Authors:
Anupam Gupta
Carnegie Mellon University, Pittsburgh, PA, USA
Ravishankar Krishnaswamy
Carnegie Mellon University, Pittsburgh, PA, USA
R. Ravi
Carnegie Mellon University, Pittsburgh, PA, USA
Published in:
· Proceeding
STOC '09
Proceedings of the 41st annual ACM symposium on Theory of computing
Pages 685-694
ACM
New York, NY
, USA
©2009
table of contents
ISBN: 978-1-60558-506-2
doi>
10.1145/1536414.1536507
2009 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 28
· Downloads (cumulative): 245
· Citation Count: 4
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
network design problems
nonnumerical algorithms and problems
online algorithms
theory
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 Guide to Computing Literature
All Tags
Export Formats
Save to Binder