How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions. Höhn, W., Mestre, J., & Wiese, A. In Esparza, J., Fraigniaud, P., Husfeldt, T., & Koutsoupias, E., editors, Automata, Languages, and Programming, of Lecture Notes in Computer Science, pages 625--636. Springer Berlin Heidelberg, July, 2014.
How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions [link]Paper  bibtex   
@incollection{hohn_how_2014,
	series = {Lecture {Notes} in {Computer} {Science}},
	title = {How {Unsplittable}-{Flow}-{Covering} {Helps} {Scheduling} with {Job}-{Dependent} {Cost} {Functions}},
	copyright = {©2014 Springer-Verlag Berlin Heidelberg},
	isbn = {978-3-662-43947-0, 978-3-662-43948-7},
	url = {http://link.springer.com/chapter/10.1007/978-3-662-43948-7_52},
	language = {en},
	number = {8572},
	urldate = {2015-04-30TZ},
	booktitle = {Automata, {Languages}, and {Programming}},
	publisher = {Springer Berlin Heidelberg},
	author = {Höhn, W. and Mestre, J. and Wiese, A.},
	editor = {Esparza, Javier and Fraigniaud, Pierre and Husfeldt, Thore and Koutsoupias, Elias},
	month = jul,
	year = {2014},
	keywords = {Algorithm Analysis and Problem Complexity, Computation by Abstract Devices, Computer Communication Networks, Discrete Mathematics in Computer Science, Information Storage and Retrieval, Information Systems Applications (incl. Internet)},
	pages = {625--636}
}

Downloads: 0