ACM DL

SIGN IN   SIGN UP

 
ACM Home Page ACM Digital Library Home Page

Tight approximation algorithms for maximum general assignment problems

Full Text: PdfPdf Buy this ArticleBuy 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
Tight approximation algorithms for maximum general assignment problems Published by ACM 2006 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 9
· Downloads (12 Months): 83
· Citation Count: 36

Published in:
· Proceeding
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
ACM New York, NY, USA ©2006
table of contents ISBN:0-89871-605-5 doi>10.1145/1109557.1109624

Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2012 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