SIGN IN
SIGN UP
Typical properties of winners and losers in discrete optimization
Full Text:
Pdf
Buy this Article
Authors:
Rene Beier
Max-Planck-Institut für Informatik, Saarbrücken, Germany
Berthold Vöcking
Universität Dortmund, Germany
Published in:
· Proceeding
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
ACM
New York, NY
, USA
©2004
table of contents
ISBN:1-58113-852-0
doi>
10.1145/1007352.1007409
2004 Article
Bibliometrics
· Downloads (6 Weeks): 5
· Downloads (12 Months): 18
· Citation Count: 5
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
STOC'12
Share:
|
Tags:
algorithms
average-case analysis
general
optimization problems
smoothed analysis
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