SIGN IN
SIGN UP
Tight approximation algorithms for maximum general assignment problems
Full Text:
PDF
Get this Article
Authors:
Lisa Fleischer
IBM T. J. Watson Research Center
Michel X. Goemans
MIT
Vahab S. Mirrokni
MIT
Maxim Sviridenko
IBM T. J. Watson Research Center
2006 Article
Bibliometrics
· Downloads (6 Weeks): 7
· Downloads (12 Months): 83
· Downloads (cumulative): 1,090
· Citation Count: 61
Published in:
· Proceeding
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Pages 611-620
Society for Industrial and Applied Mathematics
Philadelphia, PA
, USA
©2006
table of contents
ISBN:0-89871-605-5
Tools and Resources
Buy this Article
Recommend the ACM DL
to your organization
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Author Tags
algorithms
approximation
approximation algorithms analysis
combinatorial algorithms
design and analysis of algorithms
theory
Contact Us
|
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
**
Advertisements
Powered by
Did you know the ACM DL App is now available?
Did you know your Organization can subscribe to the ACM Digital Library?
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder