Optimizing misdirection

In this paper we consider the following problem. Given a (d + 1)-claw free graph G = (V, E, w) where w : V → R+, maximize w(A) where A is an independent set in G. Our focus is to minimize the approximation ratio (optimum/obtained) in polynomial time that does not depend on d. Our approach is to appl... View More