How to Sell Hyperedges: The Hypermatching Assignment Problem

We are given a set of clients with budget constraints and a set of indivisible items. Each client is willing to buy one or more bundles of (at most) k items each (bundles can be seen as hyperedges in a k-hypergraph). If client i gets a bundle e, she pays bi,e and yields a net profit wi,e. The Hypermatching Assignment Problem (HAP) is to assign a set of pairwise disjoint bundles to clients so as to maximize the total profit while respecting the budgets. This problem has various applications in production planning and budget-constrained auctions and generalizes well-studied problems in combinatorial optimization: for example the weighted (unweighted) k-hypergraph matching problem is the special case of HAP with one client having unbounded budget and general (unit) profits; the Generalized Assignment Problem (GAP) is the special case of HAP with k = 1. Let e > 0 denote an arbitrarily small constant. In this paper we obtain the following main results: • We give a randomized (k + 1 + e) approximation algorithm for HAP, which is based on rounding the 1-round Lasserre strengthening of a novel LP. This is one of a few approximation results based on Lasserre hierarchies and our approach might be of independent interest. We remark that for weighted k-hypergraph matching no LP nor SDP relaxation is known to have integrality gap better than k − 1 + 1/k for general k [Chan and Lau, SODA'10]. • For the relevant special case that one wants to maximize the total revenue (i.e., bi,e = wi,e), we present a local search based (k + O (√k))/2 approximation algorithm for k = O(1). This almost matches the best known (k + 1 + e)/2 approximation ratio by Berman [SWAT'00] for the (less general) weighted k-hypergraph matching problem. • For the unweighted k-hypergraph matching problem, we present a (k + 1 + e)/3 approximation in quasipolynomial time. This improves over the (k + 2)/3 approximation by Halldorsson [SODA'95] (also in quasipolynomial time). In particular this suggests that a 4/3 + e approximation for 3-dimensional matching might exist, whereas the currently best known polynomial-time approximation ratio is 3/2.

[1]  Barun Chandra,et al.  Greedy local improvement and weighted set packing approximation , 2001, SODA '99.

[2]  Jonas Holmerin,et al.  Clique Is Hard to Approximate within n1-o(1) , 2000, ICALP.

[3]  Grant Robert Schoenebeck.  Limitations of Linear and Semidefinite Programs , 2010 .

[4]  Madhur Tulsiani,et al.  Convex Relaxations and Integrality Gaps , 2012 .

[5]  Alexander Schrijver,et al.  Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..

[6]  Thomas Rothvoß.  Directed Steiner Tree and the Lasserre Hierarchy , 2011, ArXiv.

[7]  Gyanit Singh,et al.  Improved Approximation Guarantees through Higher Levels of SDP Hierarchies , 2008, APPROX-RANDOM.

[8]  George J. Minty,et al.  On maximal independent sets of vertices in claw-free graphs , 1980, J. Comb. Theory B.

[9]  Alexander Schrijver,et al.  On the Size of Systems of Sets Every t of Which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems , 1989, SIAM J. Discret. Math..

[10]  Yuk Hei Chan,et al.  On linear and semidefinite programming relaxations for hypergraph matching , 2010, Mathematical Programming.

[11]  Magnús M. Halldórsson,et al.  Approximating discrete collections via local improvements , 1995, SODA '95.

[12]  Eden Chlamtác,et al.  Approximation Algorithms Using Hierarchies of Semidefinite Programming Relaxations , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[13]  Wenceslas Fernandez de la Vega,et al.  Linear programming relaxations of maxcut , 2007, SODA '07.

[14]  Sanjeev Khanna,et al.  A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem , 2005, SIAM J. Comput..

[15]  Venkatesan Guruswami,et al.  Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Graph Partitioning and Quadratic Integer Programming with PSD Objectives , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[16]  Piotr Berman,et al.  Approximating maximum independent set in bounded degree graphs , 1994, SODA '94.

[17]  Piotr Berman,et al.  A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs , 2000, Nord. J. Comput..

[18]  Avner Magen,et al.  Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy , 2009, APPROX-RANDOM.

[19]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[20]  Claire Mathieu,et al.  Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack , 2011, IPCO.

[21]  Gagan Goel,et al.  On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP , 2010, SIAM J. Comput..

[22]  V. Mirrokni,et al.  Tight approximation algorithms for maximum general assignment problems , 2006, SODA 2006.

[23]  Éva Tardos,et al.  An approximation algorithm for the generalized assignment problem , 1993, Math. Program..

[24]  Oded Schwartz,et al.  On the complexity of approximating k-set packing , 2006, computational complexity.

[25]  Piotr Berman,et al.  Optimizing misdirection , 2003, SODA '03.

[26]  Jean B. Lasserre,et al.  An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs , 2001, IPCO.

[27]  Warren P. Adams,et al.  A hierarchy of relaxation between the continuous and convex hull representations , 1990 .

[28]  Hanif D. Sherali,et al.  A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems , 1990, SIAM J. Discret. Math..

[29]  Venkatesan Guruswami,et al.  MaxMin allocation via degree lower-bounded arborescences , 2009, STOC '09.

[30]  Uriel Feige,et al.  The Submodular Welfare Problem with Demand Queries , 2010, Theory Comput..