Aktuelle Veröffentlichungen

Marian Weiss, Johannes Patrick Frohnmayer, Lucia Theresa Benk, Barbara Haller, Jan-Willi Janiesch, Thomas Heitkamp, Michael Börsch, Rafael B. Lira, Rumiana Dimova, Reinhard Lipowsky, Eberhard Bodenschatz, Jean-Christophe Baret, Tanja Vidakovic-Koch, Kai Sundmacher, Ilia Platzman, Joachim P. Spatz

Axel von Kamp und Steffen Klamt
Growth-coupled overproduction is feasible for almost all metabolites in five major production organisms
Nature Communications 8, 15926, 22. Juni 2017.
DOI: 10.1038/ncomms15956

Antonio Sorrentino, Tanja Vidakovic-Koch, Richard Hanke-Rauschenbach, Kai Sundmacher
Concentration-alternating frequency response: A new method for studying polymer electrolyte membrane fuel cell dynamics
Electrochimica Acta, Volume 243, 20. Juli 2017, pp. 53-64.
DOI: 10.1016/j.electacta.2017.04.150

Non-equimolar discrete compounds in binary chiral systems of organic substances
CrystEngComm, 2017,19, 1851-1869.
DOI: 10.1039/C6CE02209J
Open Access Article

Peter Benner , Albert Cohen, Mario Ohlberger, und Karen Willcox (Eds.)
Model Reduction and Approximation: Theory and Algorithms
SIAM Publications, Philadelphia, PA, 2017.

Peter Benner
System Reduction for Nanoscale IC Design
Springer International Publishing AG. 2017.
DOI: 10.1007/978-3-319-07236-4

Zu ausgewählten Publikationen ...



Willkommen am Max-Planck-Institut Magdeburg


MALOC Event Series

3439 1446721298

Magdeburg Lectures on Optimization and Control: No Small Linear Program Approximates Vertex Cover within a Factor 2-ε

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. [mehr]

loading content