5138 search results - page 91 / 1028 » Randomized Algorithms for 3-SAT |
114
click to vote
SODA
1997
ACM
15 years 3 months ago
1997
ACM
We give a polynomial-time algorithm for the following problem: Given a degree sequence in which each degree is bounded from above by a constant, select, uniformly at random, an un...
119
click to vote
SODA
2010
ACM
15 years 11 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...
COCO
2005
Springer
15 years 7 months ago
2005
Springer
STOC
2010
ACM
15 years 6 months ago
2010
ACM
184
click to vote
CJ
2011
14 years 5 months ago
2011
Ad Hoc networks are characterized by fast dynamic changes in the topology of the network. A known technique to improve QoS is to use Multipath routing where packets (voice/video/â...