790 search results - page 64 / 158 » Subexponential Parameterized Algorithms |
108
click to vote
JAIR
2010
15 years 1 months ago
2010
The paper investigates parameterized approximate message-passing schemes that are based on bounded inference and are inspired by Pearl’s belief propagation algorithm (BP). We st...
108
click to vote
WEA
2009
Springer
15 years 10 months ago
2009
Springer
We propose new practical algorithms to find degree-relaxed variants of cliques called s-plexes. An s-plex denotes a vertex subset in a graph inducing a subgraph where every vertex...
119
Voted
ICC
2008
IEEE
15 years 9 months ago
2008
IEEE
Abstract—We develop a family of distributed wireless scheduling algorithms that requires only O(1) complexity for M-hop interference model, for any finite M. The recent technolo...
127
click to vote
WEA
2005
Springer
15 years 8 months ago
2005
Springer
This work is motivated by the long-standing open problem of designing a polynomial-time algorithm that with high probability constructs an asymptotically maximum independent set in...
149
click to vote
ECCC
2006
15 years 3 months ago
2006
We focus on the problem of computing an -Nash equilibrium of a bimatrix game, when is an absolute constant. We present a simple algorithm for computing a 3 4 -Nash equilibrium for ...