English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  A Tight Lower Bound for Online Convex Optimization with Switching Costs

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.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/21.11116/0000-0002-9F30-5 Version Permalink: https://hdl.handle.net/21.11116/0000-0002-9F31-4
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Antoniadis, Antonios1, Author           
Schewior, Kevin2, Author
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              
2External Organizations, ou_persistent22              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 20182018
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: Antoniadis_WAOA2017
DOI: 10.1007/978-3-319-89441-6_13
 Degree: -

Event

show
hide
Title: 15th Workshop on Approximation and Online Algorithms
Place of Event: Vienna, Austria
Start-/End Date: 2017-09-07 - 2017-09-08

Legal Case

show

Project information

show

Source 1

show
hide
Title: Approximation and Online Algorithms
  Abbreviation : WAOA 2017
  Subtitle : 15th International Workshop, WAOA 2017 ; Vienna, Austria, September 7-8, 2017 ; Revised Selected Papers
Source Genre: Proceedings
 Creator(s):
Solis-Oba, Roberto1, Editor           
Fleischer, Rudolf1, Editor           
Affiliations:
1 Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019            
Publ. Info: Berlin : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 164 - 165 Identifier: ISBN: 978-3-319-89440-9

Source 2

show
hide
Title: Lecture Notes in Computer Science
  Abbreviation : LNCS
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 10787 Sequence Number: - Start / End Page: - Identifier: -