50 search results - page 2 / 10 » Random knapsack in expected polynomial time |
98
Voted
STACS
2005
Springer
15 years 5 months ago
2005
Springer
The subset sum problem (SSP) (given n numbers and a target bound B, find a subset of the numbers summing to B), is one of the classical NP-hard problems. The hardness of SSP vari...
89
Voted
SIAMJO
2002
14 years 11 months ago
2002
In this paper we study a Monte Carlo simulation based approach to stochastic discrete optimization problems. The basic idea of such methods is that a random sample is generated and...
123
click to vote
IPL
2000
14 years 11 months ago
2000
We combine two known polynomial time approximation algorithms for the maximum traveling salesman problem to obtain a randomized algorithm which outputs a solution with expected va...
112
Voted
CAV
2001
Springer
15 years 3 months ago
2001
Springer
We consider the randomized consensus protocol of Aspnes and Herlihy for achieving agreement among N asynchronous processes that communicate via read/write shared registers. The alg...
124
click to vote
ICALP
2003
Springer
15 years 4 months ago
2003
Springer
Abstract. We present an expected polynomial time algorithm to generate a labeled planar graph uniformly at random. To generate the planar graphs, we derive recurrence formulas that...