Sciweavers

5580 search results - page 150 / 1116
» Randomized priority algorithms
Sort
View
SIAMCOMP
1998
137views more  SIAMCOMP 1998»
14 years 9 months ago
Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approximation algorithms for the set cover probl...
Sridhar Rajagopalan, Vijay V. Vazirani
STOC
2005
ACM
101views Algorithms» more  STOC 2005»
15 years 10 months ago
Lower bounds for k-DNF resolution on random 3-CNFs
We prove exponential lower bounds for the refutation of a random 3-CNF with linear number of clauses by k-DNF Resolution for k log n/ log log n. For this we design a specially ta...
Michael Alekhnovich
APPROX
2006
Springer
105views Algorithms» more  APPROX 2006»
15 years 1 months ago
Monotone Circuits for the Majority Function
We present a simple randomized construction of size O
Shlomo Hoory, Avner Magen, Toniann Pitassi
CDC
2008
IEEE
144views Control Systems» more  CDC 2008»
15 years 4 months ago
On the convergence time of distributed quantized averaging algorithms
— We come up with novel quantized averaging algorithms on synchronous and asynchronous communication networks with fixed, switching and random topologies. The implementation of ...
Minghui Zhu, Sonia Martínez
JSAT
2006
119views more  JSAT 2006»
14 years 10 months ago
A Faster Clause-Shortening Algorithm for SAT with No Restriction on Clause Length
We give a randomized algorithm for testing satisfiability of Boolean formulas in conjunctive normal form with no restriction on clause length. This algorithm uses the clauseshorte...
Evgeny Dantsin, Alexander Wolpert