A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Nikhil Bansal' in GoogleThis author has not been identified. Look up 'Anupam Gupta' in GoogleThis author has not been identified. Look up 'Ravishankar Krishnaswamy' in GoogleThis author has not been identified. Look up 'Kirk Pruhs' in GoogleThis author has not been identified. Look up 'Kevin Schewior' in GoogleThis author has not been identified. Look up 'Clifford Stein' in Google

runs on WebDSL