Skip to content (access key 's')
Logo of Technion
Logo of CS Department


Theory Seminar: Analysis of Two-variable Recurrence Relations with Application to Parameterized Approximations
event speaker icon
Ariel Kulik (CS, Technion)
event date icon
Wednesday, 11.11.2020, 12:30
event location icon
Zoom, Meeting ID: 954 7347 4134, Password: 5-digit Technion Zip Code
In this paper we introduce randomized branching as a tool for parameterized approximation and develop the mathematical machinery for its analysis. Our algorithms improve the best known running times of parameterized approximation algorithms for Vertex Cover and 3-Hitting Set for a wide range of approximation ratios. One notable example is a simple parameterized random 1.5-approximation algorithm for Vertex Cover, whose running time of O*(1.01657k) substantially improves the best known running time of O*(1.0883k) [Brankovic and Fernau, 2013]. For 3-Hitting Set we present a parameterized random $2$-approximation algorithm with running time of O*(1.0659k), improving the best known O*(1.29k) algorithm of [Brankovic and Fernau, 2012].

The running times of our algorithms are derived from an asymptotic analysis of a wide class of two-variable recurrence relations. We show an equivalence between these recurrences and a stochastic process, which we analyze using the Method of Types, by introducing an adaptation of Sanov’s theorem to our setting. We believe our novel analysis of recurrence relations, which is of independent interest, is a main contribution of this paper.

More details.

[Back to the index of events]