How Unsplittable-flow-covering Helps Scheduling with Job-dependent Cost 
Functions

Höhn, Wiebke; Mestre, Julian; Wiese, Andreas

doi:10.1007/978-3-662-43948-7_52

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

How Unsplittable-flow-covering Helps Scheduling with Job-dependent Cost Functions

MPS-Authors

/persons/resource/persons45742

Wiese, Andreas
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

Link
(Any fulltext)

http://arxiv.org/abs/1403.1376
(Preprint)

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

Höhn, W., Mestre, J., & Wiese, A. (2014). How Unsplittable-flow-covering Helps Scheduling with Job-dependent Cost Functions. In J. Esparza, P. Fraigniaud, T. Husfeldt, & E. Koutsoupias (Eds.), Automata, Languages, and Programming (pp. 625-636). Berlin: Springer. doi:10.1007/978-3-662-43948-7_52.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0024-4339-F

Abstract

There is no abstract available