Sciweavers

SODA
2010
ACM
234views Algorithms» more  SODA 2010»
14 years 1 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