( en | de | ru )

 

Disambiguation of "Pokutta, Sebastian"

Author of the publication

copydeleteadd this publication to your clipboard
Average case polyhedral complexity of the maximum stable set problem.

, , and . CoRR, (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Sebastian Pokutta

Lilla Pokutta

Sebastian Baum

Optimierung der Pharmakotherapie von geriatrischen Patienten im stationären Bereich durch pharmazeutische Betreuung. Uni Münster, (2009)

Sebastian Birk

Intercalibration of national methods to assess the ecological quality of rivers in Europe using benthic invertebrates and aquatic flora. Uni Duisburg-Essen, (2009)

Sebastian Stange

Market liquidity risk. TU München, (2009)
 

Other publications of authors with the same name

No Small Linear Program Approximates Vertex Cover Within a Factor 2 - ɛ., , , and . Math. Oper. Res., 44 (1): 147-172 (2019)Restarting Frank-Wolfe., , and . AISTATS, volume 89 of Proceedings of Machine Learning Research, page 1275-1283. PMLR, (2019)Structured Robust Submodular Maximization: Offline and Online Algorithms., , , , , and . AISTATS, volume 89 of Proceedings of Machine Learning Research, page 3128-3137. PMLR, (2019)Rank of random half-integral polytopes - extended abstract -., and . Electron. Notes Discret. Math., (2010)Integer-empty polytopes in the 0/1-cube with maximal Gomory-Chvátal rank., and . Oper. Res. Lett., 39 (6): 457-460 (2011)LP and SDP inapproximability of combinatorial problems., , and . CoRR, (2014)Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds., , , , and . STOC, page 95-106. ACM, (2012)Efficient algorithms for robust submodular maximization under matroid constraints., , and . CoRR, (2018)Linear vs. Semidefinite Extended Formulations: Exponential Separation and Strong Lower Bounds, , , , and . CoRR, (2011)No Small Linear Program Approximates Vertex Cover within a Factor 2-ε., , , and . CoRR, (2015)