de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

A Fully Polynomial-Time Approximation Scheme for Speed Scaling with Sleep State

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons79185

Antoniadis,  Antonios
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons79409

Ott,  Sebastian
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Antoniadis, A., Huang, C.-C., & Ott, S. (2015). A Fully Polynomial-Time Approximation Scheme for Speed Scaling with Sleep State. In P. Indyk (Ed.), Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1102-1113). Philadelphia, PA: SIAM. doi:10.1137/1.9781611973730.74.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0024-42DB-9
Abstract
There is no abstract available