Improved approximations of packing and covering problems

Aravind Srinivasan. Improved approximations of packing and covering problems. In Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, USA. pages 268-276, ACM, 1995. [doi]

@inproceedings{Srinivasan95,
  title = {Improved approximations of packing and covering problems},
  author = {Aravind Srinivasan},
  year = {1995},
  doi = {10.1145/225058.225138},
  url = {http://doi.acm.org/10.1145/225058.225138},
  researchr = {https://researchr.org/publication/Srinivasan95},
  cites = {0},
  citedby = {0},
  pages = {268-276},
  booktitle = {Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, USA},
  publisher = {ACM},
}