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 exists with a 1.0071-factor approximation guarantee, unless P = NP [BK98]. We consider...
| Main Authors: | , , |
|---|---|
| Other Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Association for Computing Machinery,
2012-11-28T18:23:38Z.
|
| Subjects: | |
| Online Access: | Get fulltext |