Sciweavers

Share
SODA
2010
ACM

PTAS for maximum weight independent set problem with random weights in bounded degree graphs

10 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 polynomial time approximation algorithm ex
David Gamarnik, David Goldberg, Theophane Weber
Added 01 Mar 2010
Updated 02 Mar 2010
Type Conference
Year 2010
Where SODA
Authors David Gamarnik, David Goldberg, Theophane Weber
Comments (0)
books