Sciweavers

315 search results - page 12 / 63
» Eigenvalue bounds for independent sets
Sort
View
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
14 years 4 months ago
Optimal Sherali-Adams Gaps from Pairwise Independence
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...
Konstantinos Georgiou, Avner Magen, Madhur Tulsian...
ESA
2001
Springer
132views Algorithms» more  ESA 2001»
14 years 2 months ago
Greedy Algorithms for Minimisation Problems in Random Regular Graphs
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
Michele Zito
ECAI
2006
Springer
14 years 1 months ago
Coalition Structure Generation in Task-Based Settings
The coalition formation process, in which a number of independent, autonomous agents come together to act as a collective, is an important form of interaction in multi-agent system...
Viet Dung Dang, Nicholas R. Jennings
STOC
1987
ACM
82views Algorithms» more  STOC 1987»
14 years 1 months ago
Permutation Groups in NC
We show that the basic problems of permutation group manipulation admit e cient parallel solutions. Given a permutation group G by a list of generators, we nd a set of NC-e cient ...
László Babai, Eugene M. Luks, &Aacut...
MOC
2010
13 years 4 months ago
H(div) preconditioning for a mixed finite element formulation of the diffusion problem with random data
We study H(div) preconditioning for the saddle-point systems that arise in a stochastic Galerkin mixed formulation of the steady-state diffusion problem with random data. The key i...
Howard C. Elman, Darran G. Furnival, Catherine E. ...