de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44014

Anand,  S.
Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Discrete Optimization, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons44182

Bringmann,  Karl
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons44447

Friedrich,  Tobias
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons44477

Garg,  Naveen
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Anand, S., Bringmann, K., Friedrich, T., Garg, N., & Kumar, A. (2017). Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines. Algorithmica, 77(2), 515-536. doi:10.1007/s00453-015-0082-y.


Cite as: http://hdl.handle.net/11858/00-001M-0000-002C-5527-9
Abstract
There is no abstract available