Publisher
Springer Nature Switzerland
Reference24 articles.
1. Bazzi, A., Fiorini, S., Pokutta, S., Svensson, O.: No small linear program approximates vertex cover within a factor $$2-\varepsilon $$. Math. Oper. Res. 44(1), 147–172 (2019)
2. Braun, G., Fiorini, S., Pokutta, S., Steurer, D.: Approximation limits of linear programs (beyond hierarchies). Math. Oper. Res. 40(3), 756–772 (2015)
3. Braun, G., Pokutta, S.: The matching polytope does not admit fully-polynomial size relaxation schemes. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 837–846. SIAM (2014)
4. Braun, G., Pokutta, S.: The matching problem has no fully polynomial size linear programming relaxation schemes. IEEE Trans. Inf. Theory 61(10), 5754–5764 (2015)
5. Braun, G., Pokutta, S.: Common information and unique disjointness. Algorithmica 76, 597–629 (2016)