2000 character limit reached
Constructing Concrete Hard Instances of the Maximum Independent Set Problem (1807.03739v1)
Published 5 Jul 2018 in cs.DS, cond-mat.dis-nn, cond-mat.stat-mech, and cs.CC
Abstract: We provide a deterministic construction of hard instances for the maximum independent set problem (MIS). The constructed hard instances form an infinite graph sequence with increasing size, which possesses similar characteristics to sparse random graphs and in which MIS cannot be solved efficiently. We analytically and numerically show that all algorithms employing cycle-chain refutation, which is a general refutation method we introduce for capturing the ability of many known algorithms, cannot upper bound the size of the maximum independent set tightly.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
