First Page | Document Content | |
---|---|---|
Date: 2016-01-03 06:45:57Computational complexity theory Theory of computation Analysis of algorithms Operations research Scheduling Algorithm Mathematical logic Theoretical computer science Time complexity NC Job shop scheduling | Minimizing maximum (weighted) flow-time on related and unrelated machines S. Anand1 Karl Bringmann2 Tobias Friedrich3 Naveen Garg1 Amit Kumar1 1Add to Reading ListSource URL: people.mpi-inf.mpg.deDownload Document from Source WebsiteFile Size: 389,64 KBShare Document on Facebook |
Form LR-ER Page 1 of 6 (RevMailing Address P.O. BoxRaleigh, NCDocID: 1xW0N - View Document | |
NC DEPARTMENT OF THE SECRETARY OF STATE NORTH CAROLINA LOBBYING COMPLIANCE DIVISION COMPLAINT FORM Mail to: North Carolina Lobbying Compliance DivisionDocID: 1xVui - View Document | |
Mailing Address P.O. BoxRaleigh, NC Liaison Expense Report Form – Zero Expense Short FormDocID: 1xVif - View Document | |
Mailing Address P.O. BoxRaleigh, NCDocID: 1xV1x - View Document | |
Mailing Address P.O. BoxRaleigh, NCDocID: 1xUOl - View Document |