Please use this identifier to cite or link to this item:
|Title:||How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions|
|Citation:||How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions, Proceedings of the 41st International Colloquium on Automata, Languages, and Programming (ICALP 2014), Part 1, vol.8572, 2014, pp. 625-636|
|Disclaimer:||This work has been made available to the staff and students of the University of Sydney for the purposes of research and study only. It constitutes material that is held by the University for the purposes of reporting for HERDC and the ERA. This work may not be downloaded, copied and distributed to any third party .|
|Type:||E1 - Conference proceeding|
|Appears in Collections:||University of Sydney Research Outputs|
Items in Sydney Research Online are protected by copyright, with all rights reserved, unless otherwise indicated.