WALCOM 2019

The 13th International Conference and Workshops on Algorithms and Computation, February 27 - March 02, 2019 | Indian Institute of Technology Guwahati (IIT Guwahati)
Chrome CSS Drop Down Menu
Pre-Conference Workshop is on February 27, 2019


Title of the Talk: Low Memory Algorithms

Abstract: The effciency of an algorithm is mainly measured using two terms: time and space. As the trend of using and handling large pool of data is going to im- pact new age of computing, the space-e ciency of an algorithm gets spacious attention. In this talk, we focus on space-effcient aspects of some fundamental geometric optimization problems while not deteriorating the time complexity too much. Mainly, we will focus on the important tools available in the literature that works on data residing in the read-only memory. Algorithms, approximations and lower bound results will be discussed.

Prof. Subhas C. Nandy
Indian Statistical Institute, Kolkata

Title of the Talk: Algorithm on (Fat)-Trees and its Applications in Designing Approximation and Exact Algorithms

Abstract: Most of the NP-hard optimization problems becomes tractable on trees. That is, they admit a polynomial (even linear) time algorithms on trees. In this two part tutorial we will look at trees and its modern generalisation treewidth and its algorithmic applications. In the first session we will see structural properties of graphs of bounded treewidth are and how to do dynamic programming over it. In the second session we will see how these dynamic programming algorithms over graphs of bounded treewidth are used as subroutine in designing polynomial time approximation schemes (PTASes), exact algorithms and parameterized algorithms.

Prof. Saket Saurabh
Institute of Mathematical Sciences, India
© 2019 WALCOM 2019: The 13th International Conference and Workshops on Algorithms and Computation