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

• Type: Conference
• Year: 2010
• Where: SODA
• Authors: David Gamarnik, David Goldberg, Theophane Weber
• Keywords: Approximation Algorithm Ex, Discrete Algorithms, NP-complete Combinatorial Optimization, SODA 2010