Publications

Abstract : In the modern interactive computing era, computational problems such as scheduling, rout- ing, sequencing, and resource management are online in nature. In the online framework, at the outset, an algorithm receives and processes inputs one by one in order without the knowledge of future inputs, unlike in an offline framework, where an algorithm knows the entire input sequence at the beginning. The design of mathematical models and efficient al- gorithms for the online framework constitutes a challenging and competitive area of research in Theoretical Computer Science. The researchers have considered competitive analysis as a well-de ned and standard method to measure the performance of online algorithms.