Approximate the k-Set Packing Problem by Local Improvements

@inproceedings{Frer2014ApproximateTK,
  title={Approximate the k-Set Packing Problem by Local Improvements},
  author={Martin F{\"u}rer and Huiwen Yu},
  booktitle={ISCO},
  year={2014}
}
We study algorithms based on local improvements for the k-Set Packing problem. The well-known local improvement algorithm by Hurkens and Schrijver [13] has been improved by Sviridenko and Ward [14] from k 2 + to k+2 3 , and by Cygan [7] to k+1 3 + for any > 0. In this paper, we achieve the approximation ratio k+1 3 + for the k-Set Packing problem using a simple polynomial-time algorithm based on the method by Sviridenko and Ward [14]. With the same approximation guarantee, our algorithm runs in… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 2 times over the past 90 days. VIEW TWEETS