Improved approximations of packing and covering problems
Aravind Srinivasan · 1995
Article Free Access Share on Improved approximations of packing and covering problems Author: Aravind Srinivasan School of Mathematics, Institute for Advanced Study, Princeton, NJ and DIMACS (NSF Center for Discrete Mathematics and Theoretical Computer Science), Rutgers University, Piscataway, NJ School of Mathematics, Institute for Advanced Study, Princeton, NJ and DIMACS (NSF Center for Discrete Mathematics and Theoretical Computer Science), Rutgers University, Piscataway, NJView Profile Authors Info & Claims STOC '95: Proceedings of the twenty-seventh annual ACM symposium on Theory of computingMay 1995 Pages 268–276https://doi.org/10.1145/225058.225138Online:29 May 1995Publication History 55citation1,107DownloadsMetricsTotal Citations55Total Downloads1,107Last 12 Months47Last 6 weeks13 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF