Back to Results
First PageMeta Content
Computational 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 1
Add to Reading List

Document Date: 2016-01-03 06:45:57

Open Document

File Size: 389,64 KB

Share Result on Facebook