# Label cover instances with large girth and the hardness of approximating basic k-spanner

ACM Trans. Algorithms, Volume 12, Issue 2, 2016.

EI

Abstract:

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-\epsilon} n)/k}$ hard to approximate for all constant ε0. A similar theorem was claimed by Elkin and Peleg [ICALP 2000] as part of an attempt to prov...More

Code:

Data: