Sciweavers

170 search results - page 4 / 34
» k-Wise Independent Random Graphs
Sort
View
90
Voted
SODA
2010
ACM
234views Algorithms» more  SODA 2010»
15 years 8 months ago
PTAS for maximum weight independent set problem with random weights in bounded degree graphs
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...
David Gamarnik, David Goldberg, Theophane Weber
COCO
2001
Springer
101views Algorithms» more  COCO 2001»
15 years 3 months ago
Resolution Complexity of Independent Sets in Random Graphs
Paul Beame, Russell Impagliazzo, Ashish Sabharwal
CPC
2006
91views more  CPC 2006»
14 years 11 months ago
On the Independent Domination Number of Random Regular Graphs
William Duckworth, Nicholas C. Wormald
CC
2007
Springer
14 years 11 months ago
The Resolution Complexity of Independent Sets and Vertex Covers in Random Graphs
Paul Beame, Russell Impagliazzo, Ashish Sabharwal
57
Voted
CPC
2004
65views more  CPC 2004»
14 years 10 months ago
On the b-Independence Number of Sparse Random Graphs
Geoffrey Atkinson, Alan M. Frieze