Improved Approximation for 3-Dimensional Matching via Bounded Pathwidth Local Search

@article{Cygan2013ImprovedAF,
  title={Improved Approximation for 3-Dimensional Matching via Bounded Pathwidth Local Search},
  author={Marek Cygan},
  journal={2013 IEEE 54th Annual Symposium on Foundations of Computer Science},
  year={2013},
  pages={509-518}
}
One of the most natural optimization problems is the k-SET PACKING problem, where given a family of sets of size at most k one should select a maximum size subfamily of pairwise disjoint sets. A special case of 3-SET PACKING is the well known 3-DIMENSIONAL MATCHING problem, which is a maximum hypermatching problem in 3-uniform tripartite hypergraphs. Both problems belong to the Karp's list of 21 NP-complete problems. The best known polynomial time approximation ratio for k-SET PACKING is (k… CONTINUE READING