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

14 years 8 months ago

Download siam.org

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

Real-time Traffic

Approximation Algorithm Ex | Discrete Algorithms | NP-complete Combinatorial Optimization | SODA 2010 |

claim paper

» SDPBased Algorithms for Maximum Independent Set Problems on Hypergraphs

» Approximation Algorithms for the Weighted Independent Set Problem

» On the practical complexity of solving the maximum weighted independent set problem for op...

» Shifting Strategy for Geometric Graphs without Geometry

» Experimental Evaluation of the Greedy and Random Algorithms for Finding Independent Sets i...

» ConstantTime Approximation Algorithms via Local Improvements

» Fast distributed approximation algorithms for vertex cover and set cover in anonymous netw...

» Vertex Cover in Graphs with Locally Few Colors

Post Info
More Details (n/a)

Added	01 Mar 2010
Updated	02 Mar 2010
Type	Conference
Year	2010
Where	SODA
Authors	David Gamarnik, David Goldberg, Theophane Weber

Comments (0)

Sciweavers

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

Approximation Algorithm Ex | Discrete Algorithms | NP-complete Combinatorial Optimization | SODA 2010 |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers