Finding the largest independent set in a graph is a notoriously difficult NP-complete combinatorial optimization problem. Moreover, even for graphs with largest degree 3, no polyn...
In the Euclidean TSP with neighborhoods (TSPN), we are given a collection of n regions (neighborhoods) and we seek a shortest tour that visits each region. In the path variant, we...
Iterative algorithm based on quantum tunneling is proposed by making use of mean-eld approximation. W e apply our method to the problem of BW image reconstruction (IR). Its perfor...
We provide a priori error estimates for variational approximations of the ground state eigenvalue and eigenvector of nonlinear elliptic eigenvalue problems of the form -div(Au) + ...
We give subexponential time approximation algorithms for UNIQUE GAMES and the SMALL-SET EXPANSION. Specifically, for some absolute constant c, we give: