Schulze, P.; Leschinsky, M.; Seidel-Morgenstern, A.; Lorenz, H.: Continuous Separation of Lignin from Organosolv Pulping Liquors: Combined Lignin Particle Formation and Solvent Recovery. Industrial and Engineering Chemistry Research 58, S. 3797 - 3810 (2019)
Benner, P.; Khoromskaia, V.; Khoromskij, B. N.; Yang, C.: Computing the Density of States for Optical Spectra of Molecules by Low-Rank and QTT Tensor Approximation. Journal of Computational Physics 382, S. 221 - 239 (2019)
Kupke, S. Y.; Riedel, D.; Frensing, T.; Zmora, P.; Reichl, U.: A Novel Type of Influenza A Virus-Derived Defective Interfering Particle with Nucleotide Substitutions in Its Genome. Journal of Virology 93 (4), 01786-18 (2019)
The vertex cover problem is one of the most important and intensively studied combinatorial optimization problems. Khot and Regev (2003) proved that the problem is NP-hard to approximate within a factor 2-ε, assuming Khot's famous Unique Games Conjecture (UGC). This is tight because the problem has an easy 2-approximation algorithm.
We prove the following unconditional result about linear programming (LP) relaxations of the problem: every LP relaxation that approximates vertex cover within a factor 2-ε has super-polynomially many inequalities.