Prefer a chat interface with context about you and your work?
Label Cover Instances with Large Girth and the Hardness of Approximating Basic <i>k</i> -Spanner
We study the well-known Label Cover problem under the additional requirement that problem instances have large girth. We show that if the girth is some k , the problem is roughly 2 log 1-ϵ n)/k hard to approximate for all constant ϵ > 0. A similar theorem was claimed by …