English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

A Tight Lower Bound for Online Convex Optimization with Switching Costs

MPS-Authors
/persons/resource/persons79185

Antoniadis,  Antonios
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., & Schewior, K. (2018). A Tight Lower Bound for Online Convex Optimization with Switching Costs. In R. Solis-Oba, & R. Fleischer (Eds.), Approximation and Online Algorithms (pp. 164-165). Berlin: Springer. doi:10.1007/978-3-319-89441-6_13.


Cite as: http://hdl.handle.net/21.11116/0000-0002-9F30-5
Abstract
There is no abstract available