Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and More

Graph product is a fundamental tool with rich applications in both graph theory and theoretical computer science. It is usually studied in the form f(G * H) where G and H are graphs, * is a graph product and f is a graph property. For example, if f is the independence number and * is the disjunctive product, then the product is known to be multiplicative: f(G * H) = f(G)f(H). In this paper, we study graph products in the following non-standard form: f((G⊕H)*J) where G, H and J are graphs, ⊕ and * are two different graph products and f is a graph property. We show that if f is the induced and semi-induced matching number, then for some products ⊕ and *, it is subadditive in the sense that f((G ⊕ H) * J) ≤ f(G * J) + f(H * J). Moreover, when f is the poset dimension number, it is almost subadditive. As applications of this result (we only need J = K2 here), we obtain tight hardness of approximation for various problems in discrete mathematics and computer science: bipartite induced and semi-induced matching (a.k.a. maximum expanding sequences), poset dimension, maximum feasible subsystem with 0/1 coefficients, unit-demand min-buying and single-minded pricing, donation center location, boxicity, cubicity, threshold dimension and independent packing.

[1]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[2]  Moshe Lewenstein,et al.  Tighter Approximations for Maximum Induced Matchings in Regular Graphs , 2005, WAOA.

[3]  Sampath Kannan,et al.  Improved Hardness Results for Profit Maximization Pricing Problems with Unlimited Supply , 2012, APPROX-RANDOM.

[4]  Piotr Krysta,et al.  Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems , 2011, SIAM J. Comput..

[5]  Peter W. Glynn,et al.  A Nonparametric Approach to Multiproduct Pricing , 2006, Oper. Res..

[6]  Stefan Felsner,et al.  Adjacency posets of planar graphs , 2010, Discret. Math..

[7]  Khaled M. Elbassioni,et al.  On the approximability of the maximum feasible subsystem problem with 0/1-coefficients , 2009, SODA.

[8]  Kathie Cameron,et al.  Independent packings in structured graphs , 2006, Math. Program..

[9]  Subhash Khot,et al.  Better Inapproximability Results for MaxClique, Chromatic Number and Min-3Lin-Deletion , 2006, ICALP.

[10]  Michele Zito.  Induced Matchings in Regular Graphs and Trees , 1999, WG.

[11]  Ravi Kumar,et al.  A graph-theoretic approach to extract storylines from search results , 2004, KDD.

[12]  Kamal Jain,et al.  The Hardness of Approximating Poset Dimension , 2007, Electron. Notes Discret. Math..

[13]  Sofya Raskhodnikova.  Transitive-Closure Spanners: A Survey , 2010, Property Testing.

[14]  E. L. Lawler,et al.  The partial order dimension problem is NP-complete , 2022 .

[15]  Leen Stougie,et al.  Minimizing flow time in the wireless gathering problem , 2011, TALG.

[16]  Abhijin Adiga,et al.  The hardness of approximating the boxicity, cubicity and threshold dimension of a graph , 2010, Discret. Appl. Math..

[17]  Martin Hoefer,et al.  Stackelberg Network Pricing Games , 2008, Algorithmica.

[18]  Naveen Sivadasan,et al.  Boxicity and treewidth , 2007, J. Comb. Theory, Ser. B.

[19]  Abhijin Adiga,et al.  Boxicity and Poset Dimension , 2010, SIAM J. Discret. Math..

[20]  Hong-Gwa Yeh,et al.  On the fractional chromatic number, the chromatic number, and graph products , 2002, Discret. Math..

[21]  Angelika Steger,et al.  On induced matchings , 1993, Discret. Math..

[22]  Luca Trevisan,et al.  Non-approximability results for optimization problems on bounded degree instances , 2001, STOC '01.

[23]  Venkatesan Guruswami,et al.  Inapproximability of Edge-Disjoint Paths and low congestion routing on undirected graphs , 2010, Comb..

[24]  Venkatesan Guruswami,et al.  On profit-maximizing envy-free pricing , 2005, SODA '05.

[25]  Maria-Florina Balcan,et al.  Approximation algorithms and online mechanisms for item pricing , 2006, EC '06.

[26]  David S. Johnson,et al.  The NP-Completeness Column: An Ongoing Guide , 1982, J. Algorithms.

[27]  Nathan Linial,et al.  Graph products and chromatic numbers , 1989, 30th Annual Symposium on Foundations of Computer Science.

[28]  E. Scheinerman,et al.  Fractional Graph Theory: A Rational Approach to the Theory of Graphs , 1997 .

[29]  Prasad Raghavendra,et al.  Hardness of Solving Sparse Overdetermined Linear Systems: A 3-Query PCP over Integers , 2009, TOCT.

[30]  Abhijin Adiga,et al.  Cubicity, Degeneracy, and Crossing Number , 2011, FSTTCS.

[31]  J. Håstad.  Clique is hard to approximate withinn1−ε , 1999 .

[32]  Vijay V. Vazirani,et al.  NP-Completeness of Some Generalizations of the Maximum Matching Problem , 1982, Inf. Process. Lett..

[33]  Chien-Chung Huang,et al.  Donation Center Location Problem , 2012, Algorithmica.

[34]  Ness B. Shroff,et al.  On the Complexity of Scheduling in Wireless Networks , 2010, EURASIP J. Wirel. Commun. Netw..

[35]  Patrick Briest,et al.  Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing , 2009, WINE.

[36]  Uriel Feige,et al.  Zero knowledge and the chromatic number , 1996, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory).

[37]  Nikola Milosavljevic.  On Complexity of Wireless Gathering Problems on Unit-Disk Graphs , 2011, ADHOC-NOW.

[38]  Walter Schnyder,et al.  Embedding planar graphs on the grid , 1990, SODA '90.

[39]  M. Yannakakis.  The Complexity of the Partial Order Dimension Problem , 1982 .

[40]  W. Imrich,et al.  Handbook of Product Graphs, Second Edition , 2011 .

[41]  Naveen Sivadasan,et al.  Boxicity and maximum degree , 2008, J. Comb. Theory, Ser. B.

[42]  Oded Goldreich,et al.  On the np-completeness of certain network testing problems , 1984, Networks.

[43]  Ola Svensson,et al.  Precedence Constraint Scheduling and Connections to Dimension Theory of Partial Orders , 2008, Bull. EATCS.

[44]  W. Schnyder.  Planar graphs and poset dimension , 1989 .

[45]  David Manlove,et al.  On the approximability of the maximum induced matching problem , 2005, J. Discrete Algorithms.

[46]  W. Trotter,et al.  Combinatorics and Partially Ordered Sets: Dimension Theory , 1992 .

[47]  Xuding Zhu,et al.  Star-extremal graphs and the lexicographic product , 1996, Discret. Math..