5153 search results - page 77 / 1031 » Introduction to Randomized Algorithms |
119
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...
122
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 7 months ago
2010
ACM
125
click to vote
SODA
2012
ACM
13 years 4 months ago
2012
ACM
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...