On local search and LP and SDP relaxations for k-set packing

T.S. Oosterwijk

Onderzoeksoutput: Boek/rapportRapportAcademic

37 Downloads (Pure)

Samenvatting

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 and it is strongly related to the maximum independent set problem. In this thesis we study the k-set packing problem where given a universe U and a collection C of subsets over U, each of cardinality k, one needs to find the maximum collection of mutually disjoint subsets. Local search techniques have proved to be successful in the search for approximation algorithms, both for the unweighted and the weighted version of the problem where every subset in C is associated with a weight and the objective is to maximise the sum of the weights. We make a survey of these approaches and give some background and intuition behind them. In particular, we simplify the algebraic proof of the main lemma for the currently best weighted approximation algorithm of Berman ([Ber00]) into a proof that reveals more intuition on what is really happening behind the math. The main result is a new bound of k/3 + 1 + epsilon on the integrality gap for a polynomially sized LP relaxation for k-set packing by Chan and Lau ([CL10]) and the natural SDP relaxation [NOTE: see page iii]. We provide detailed proofs of lemmas needed to prove this new bound and treat some background on related topics like semidefinite programming and the Lovasz Theta function. Finally we have an extended discussion in which we suggest some possibilities for future research. We discuss how the current results from the weighted approximation algorithms and the LP and SDP relaxations might be improved, the strong relation between set packing and the independent set problem and the difference between the weighted and the unweighted version of the problem.
Originele taal-2Engels
Uitgeverijs.n.
Aantal pagina's78
StatusGepubliceerd - 2015

Publicatie series

NaamarXiv
Volume1507.07459 [math.CO]

Vingerafdruk

Duik in de onderzoeksthema's van 'On local search and LP and SDP relaxations for k-set packing'. Samen vormen ze een unieke vingerafdruk.

Citeer dit