4894 search results - page 78 / 979 » The Guarding Problem - Complexity and Approximation |
125
Voted
SODA
2010
ACM
15 years 12 months ago
2010
ACM
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...
128
Voted
CCCG
2010
15 years 4 months ago
2010
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...
ESANN
2000
15 years 4 months ago
2000
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...
99
Voted
JSCIC
2010
14 years 9 months ago
2010
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) + ...
128
Voted
FOCS
2010
IEEE
15 years 18 days ago
2010
IEEE
We give subexponential time approximation algorithms for UNIQUE GAMES and the SMALL-SET EXPANSION. Specifically, for some absolute constant c, we give: