English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

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

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.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Antoniadis, Antonios1, Author           
Huang, Chien-Chung2, Author           
Ott, Sebastian1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              
2External Organizations, ou_persistent22              

Content

show
hide
Free keywords: Computer Science, Data Structures and Algorithms, cs.DS
 Abstract: -

Details

show
hide
Language(s): eng - English
 Dates: 201420152015
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: AHO2015
DOI: 10.1137/1.9781611973730.74
 Degree: -

Event

show
hide
Title: Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms
Place of Event: San Diego, CA, USA
Start-/End Date: 2015-01-04 - 2015-01-06

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms
  Abbreviation : SODA 2015
Source Genre: Proceedings
 Creator(s):
Indyk, Piotr, Editor
Affiliations:
-
Publ. Info: Philadelphia, PA : SIAM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 1102 - 1113 Identifier: ISBN: 978-1-61197-374-7