On local search and LP and SDP relaxations for k-Set Packing

Tim Oosterwijk

Set packing is a fundamental problem that generalises some well-known combinatorial optimization problems and knows a lot of applications. It is equivalent to hypergraph matching a…