Abstract
For every Δ>2 and ε>0 we present a polynomial time approximation algorithm for the Maximum Independent Set problem, that in a graph of degree Δ approximates an optimal solution within ratio 5/Δ+3-ε for even Δ and within ratio 5/Δ+3.25-ε for odd Δ.
| Original language | English (US) |
|---|---|
| Title of host publication | Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms |
| Publisher | Publ by ACM |
| Pages | 365-371 |
| Number of pages | 7 |
| ISBN (Print) | 0898713293 |
| State | Published - 1994 |
| Event | Proceedings of the Fifth Annual SIAM Symposium on Discrete Algorithms - Arlington, VA, USA Duration: Jan 23 1994 → Jan 25 1994 |
Other
| Other | Proceedings of the Fifth Annual SIAM Symposium on Discrete Algorithms |
|---|---|
| City | Arlington, VA, USA |
| Period | 1/23/94 → 1/25/94 |
All Science Journal Classification (ASJC) codes
- Chemical Health and Safety
- Software
- Safety, Risk, Reliability and Quality
- Discrete Mathematics and Combinatorics