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

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

doi:10.1007/s00453-017-0300-x

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

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

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

s00453-017-0300-x.pdf
(Publisher version), 490KB

Supplementary Material (public)

There is no public supplementary material available

Citation

Höhn, W., Mestre, J., & Wiese, A. (2018). How Unsplittable-flow-covering Helps Scheduling with Job-dependent Cost Functions. Algorithmica, 80(4), 1191-1213. doi:10.1007/s00453-017-0300-x.

Cite as: https://hdl.handle.net/11858/00-001M-0000-002E-2618-3

Abstract

There is no abstract available