A polynomial time approximation scheme for general multiprocessor job scheduling (extended abstract)
Jianer Chen, Antonio Miranda · 1999
Article A polynomial time approximation scheme for general multiprocessor job scheduling (extended abstract) Share on Authors: Jianer Chen Department of Computer Science, Texas A&M University, College Station, TX Department of Computer Science, Texas A&M University, College Station, TXView Profile , Antonio Miranda Department of Computer Science, Bucknell University, Lewisburg, Pennsylvania Department of Computer Science, Bucknell University, Lewisburg, PennsylvaniaView Profile Authors Info & Claims STOC '99: Proceedings of the thirty-first annual ACM symposium on Theory of ComputingMay 1999 Pages 418–427https://doi.org/10.1145/301250.301363Online:01 May 1999Publication History 20citation458DownloadsMetricsTotal Citations20Total Downloads458Last 12 Months5Last 6 weeks1 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 SiteGet Access