A Deterministic Truthful PTAS for Scheduling Related Machines

Christodoulou, George; Kovács, Annamária

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

A Deterministic Truthful PTAS for Scheduling Related Machines

MPS-Authors

/persons/resource/persons44250

Christodoulou, George
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)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Christodoulou, G., & Kovács, A. (2010). A Deterministic Truthful PTAS for Scheduling Related Machines. In M. Charikar (Ed.), 21st Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1005-1016). Philadelphia, PA: SIAM.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-15EA-6

Abstract

There is no abstract available