The r-domination search game on graphs is a game-theoretical approach to several graph and hypergraph parameters including treewidth and hypertree width. The task is to identify t...
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thi...
We present a new local approximation algorithm for computing MAP and logpartition function for arbitrary exponential family distribution represented by a finite-valued pair-wise ...
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
It has been a challenging open problem whether there is a polynomial time approximation algorithm for the Vertex Cover problem whose approximation ratio is bounded by a constant l...