English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

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

MPS-Authors
/persons/resource/persons44182

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

External Resource

https://rdcu.be/dx1WH
(Publisher version)

Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Anand, S., Bringmann, K., Friedrich, T., Garg, N., & Kumar, A. (2013). Minimizing Maximum (Weighted) Flow-time on Related and Unrelated Machines. In F. V. Fomin, R. Freivalds, M. Kwiatkowska, & D. Peleg (Eds.), Automata, Languages, and Programming (pp. 13-24). Berlin: Springer. doi:10.1007/978-3-642-39206-1_2.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0015-3AD6-F
Abstract
There is no abstract available