Label Cover Instances with Large Girth and the Hardness of Approximating Basic k -Spanner
ACM Transactions on Algorithms, pp. 252016.
Graph spannersprobabilistically checkable proofs
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-e n)/k hard to approximate for all constant e u003e 0. A similar theorem was claimed by Elkin and Peleg  as part of an attempt to prove har...More
Full Text (Upload PDF)
PPT (Upload PPT)