Thinking about getting good at competitive programming, especially on a platform like CodeChef? It can seem like ...

COMP_SCI 396, 496: Advanced Algorithm Design through the Lens of Competitive Programming VIEW ALL COURSE TIMES AND SESSIONS Prerequisites CS 336 or Permission of Instructor Description This is an ...

Formulate linear and integer programming problems for solving commonly encountered optimization problems. Understand how approximation algorithms compute solutions that are guaranteed to be within ...

In this paper, we introduce the notion of smoothed competitive analysis of online algorithms. Smoothed analysis has been proposed by Spielman and Teng [25] to explain the behavior of algorithms that ...

Shipra Agrawal, Zizhuo Wang, Yinyu Ye, A Dynamic Near-Optimal Algorithm for Online Linear Programming, Operations Research, Vol. 62, No. 4 (July-August 2014), pp. 876-890 ...