Strong Reductions for Extended Formulations

  title={Strong Reductions for Extended Formulations},
  author={G{\'a}bor Braun and Sebastian Pokutta and Aurko Roy},
We generalize the reduction mechanism between linear programming problems from [1] in two ways 1 relaxing the requirement of affineness, and 2 extending to fractional optimization problems. As applications we provide several new LP-hardness and SDP-hardness results, e.g., for the SparsestCut problem, the BalancedSeparator problem, the MaxCut problem and the Matching problem on 3-regular graphs. We also provide a new, very strong Lasserre integrality gap for the IndependentSet problem, which… 
Strengths and Limitations of Linear Programming Relaxations
This thesis addresses both the power and the limitations of linear programming relaxations, as well as the connection between the shortcomings of these relaxations and the inapproximability of the underlying problem, and obtains LP relaxations of quasi-polynomial size that are at least as strong as that given by the knapsack cover inequalities.
C C ] 1 9 Ja n 20 16 Affine reductions for LPs and SDPs
We define a reduction mechanism for LP and SDP formulations that degrades approximation factors in a controlled fashion. Our reduction mechanism is a minor restriction of classical reductions
Affine reductions for LPs and SDPs
The reduction mechanism is a minor restriction of classical hardness reductions requiring an additional independence assumption and it allows for reusing many hardness reductions that have been used to show inapproximability in the context of PCP theorems.
Treewidth, Extended Formulations of CSP and MSO Polytopes, and their Algorithmic Applications
It is concluded that a combination of the MSO logic, CSP and geometry provides an extensible framework for the design of compact extended formulations and parameterized algorithms for graphs of bounded treewidth.
Extension Complexity via Lifting LP Hierarchy Lower Bounds
The result of [CLRS13] and some subsequent ones are expalain, in particular, an extension complexity lower bound for approximating vertex-cover [BFPS15], and a very related line of research — SDP extension complexity, which studies the minimum size of SDP formulations.
New limits of treewidth-based tractability in optimization
It is proved that treewidth is the only graph-theoretical parameter that yields tractability for a wide class of optimization problems, a fact well known in Graphical Models in Machine Learning and in Constraint Satisfaction Problems, which here the authors extend to an approximation setting in Optimization.
Limits of Treewidth-based tractability in Optimization
This work proves that treewidth is the only graph-theoretical parameter that yields tractability in a wide class of optimization problems, a fact well known in Graphical Models in Machine Learning and here it is extended to Optimization.
Separations in query complexity using cheat sheets
We show a power 2.5 separation between bounded-error randomized and quantum query complexity for a total Boolean function, refuting the widely believed conjecture that the best such separation could
Limitations of Sum of Squares for 2-to-4 norm , Separability , and Entangled Games
We introduce a method for using reductions to construct integrality gaps for semidefinite programs (SDPs). These imply new limitations on the sum-of-squares (SoS) hierarchy in two settings where
Limitations of Semidefinite Programs for Separable States and Entangled Games
A new method for using reductions to construct integrality gaps for SDPs, meaning instances where the SDP value is far from the true optimum, is introduced, based on new limitations on the sum-of-squares (SoS) hierarchy in approximating two particularly important sets in quantum information theory.


Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy
Strong inapproximability results are proved in this model for well-known problems such as max-3sat, hypergraph vertex cover and set cover, and it is shown that the relaxations produced by as many as Ω(n) rounds of the LS + procedure do not allow nontrivial approximation, thus ruling out the possibility of even slightly subexponential approximation algorithms for these problems.
Approximate Constraint Satisfaction Requires Large LP Relaxations
It is shown that for these problems, polynomial-sized linear programs are exactly as powerful as programs arising from a constant number of rounds of the Sherali-Adams hierarchy.
On the Power of Symmetric LP and SDP Relaxations
For k <; n/4, it is shown that k-rounds of sum-of squares / Lasserre relaxations of size k(kn) achieve best-possible k approximation guarantees for Max CSPs among all symmetric SDP relaxation of size at most (kn).
Inapproximability of Combinatorial Problems via Small LPs and SDPs
This work defines a consistent reduction mechanism that degrades approximation factors in a controlled fashion and which, at the same time, is compatible with approximate linear and semidefinite programming formulations.
It is shown that the Multicut, Sparsest-Cut, and Min-2CNF problems are NP-hard to approximate within every constant factor, assuming the Unique Games Conjecture of Khot (2002).
LP approximations to mixed-integer polynomial optimization problems
An approximation scheme for the "AC-OPF" problem on graphs with bounded tree-width is obtained and a more general construction for pure binary optimization problems where individual constraints are available through a membership oracle is described.
No Small Linear Program Approximates Vertex Cover within a Factor 2 -- e
This work proves the following unconditional result about linear programming (LP) relaxations of the vertex cover problem: every LP relaxation that approximates vertex cover within a factor of 2 - ε has super-polynomially many inequalities.
Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph
The results indicate that approximating Densest k-subgraph within a polynomial factor might be a harder problem than Unique Games or Small Set Expansion, since these problems were recently shown to be solvable using neΩ(1) rounds of the Lasserre hierarchy, where e is the completeness parameter in Unique Games and Small Set expansion.
Lower Bounds on the Size of Semidefinite Programming Relaxations
It is proved that SDPs of polynomial-size are equivalent in power to those arising from degree-O(1) sum-of-squares relaxations, and this result yields the first super-polynomial lower bounds on the semidefinite extension complexity of any explicit family of polytopes.
Approximate Lasserre Integrality Gap for Unique Games
This paper constructs an instance of Unique Games with k labels along with an approximate vector solution to t rounds of the Lasserre SDP relaxation and shows that the answer is negative if the relaxation is insensitive to a sufficiently small perturbation of the constraints.