Tight approximation algorithms for maximum general assignment problems

Lisa Fleischer, Michel X. Goemans, Vahab S. Mirrokni, Maxim Sviridenko. Tight approximation algorithms for maximum general assignment problems. In Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006. pages 611-620, ACM Press, 2006. [doi]

@inproceedings{FleischerGMS06,
  title = {Tight approximation algorithms for maximum general assignment problems},
  author = {Lisa Fleischer and Michel X. Goemans and Vahab S. Mirrokni and Maxim Sviridenko},
  year = {2006},
  doi = {10.1145/1109557.1109624},
  url = {http://doi.acm.org/10.1145/1109557.1109624},
  researchr = {https://researchr.org/publication/FleischerGMS06},
  cites = {0},
  citedby = {0},
  pages = {611-620},
  booktitle = {Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006},
  publisher = {ACM Press},
  isbn = {0-89871-605-5},
}