Nikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs, Kevin Schewior, Clifford Stein. A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs. In Naveen Garg, Klaus Jansen, Anup Rao, José D. P. Rolim, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA. Volume 40 of LIPIcs, pages 96-109, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2015. [doi]
@inproceedings{BansalGKPSS15,
title = {A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs},
author = {Nikhil Bansal and Anupam Gupta and Ravishankar Krishnaswamy and Kirk Pruhs and Kevin Schewior and Clifford Stein},
year = {2015},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2015.96},
url = {http://dx.doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.96},
researchr = {https://researchr.org/publication/BansalGKPSS15},
cites = {0},
citedby = {0},
pages = {96-109},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA},
editor = {Naveen Garg and Klaus Jansen and Anup Rao and José D. P. Rolim},
volume = {40},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
isbn = {978-3-939897-89-7},
}