Sciweavers

170 search results - page 4 / 34
» k-Wise Independent Random Graphs
Sort
View
SODA
2010
ACM
234views Algorithms» more  SODA 2010»
14 years 5 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»
14 years 7 days ago
Resolution Complexity of Independent Sets in Random Graphs
Paul Beame, Russell Impagliazzo, Ashish Sabharwal
CPC
2006
91views more  CPC 2006»
13 years 7 months ago
On the Independent Domination Number of Random Regular Graphs
William Duckworth, Nicholas C. Wormald
CC
2007
Springer
13 years 7 months ago
The Resolution Complexity of Independent Sets and Vertex Covers in Random Graphs
Paul Beame, Russell Impagliazzo, Ashish Sabharwal
CPC
2004
65views more  CPC 2004»
13 years 7 months ago
On the b-Independence Number of Sparse Random Graphs
Geoffrey Atkinson, Alan M. Frieze