Prati
Samuel Fiorini
Naslov
Citirano
Citirano
Godina
Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds
S Fiorini, S Massar, S Pokutta, HR Tiwary, R De Wolf
Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012
2682012
Exponential lower bounds for polytopes in combinatorial optimization
S Fiorini, S Massar, S Pokutta, HR Tiwary, R De Wolf
Journal of the ACM (JACM) 62 (2), 1-23, 2015
1592015
Combinatorial bounds on nonnegative rank and extended formulations
S Fiorini, V Kaibel, K Pashkovich, DO Theis
Discrete mathematics 313 (1), 67-83, 2013
1212013
Approximation limits of linear programs (beyond hierarchies)
G Braun, S Fiorini, S Pokutta, D Steurer
Mathematics of Operations Research 40 (3), 756-772, 2015
1142015
Extended formulations for polygons
S Fiorini, T Rothvoß, HR Tiwary
Discrete & computational geometry 48 (3), 658-668, 2012
682012
The Stackelberg minimum spanning tree game
J Cardinal, ED Demaine, S Fiorini, G Joret, S Langerman, I Newman, ...
Algorithmica 59, 129-144, 2011
582011
A short proof of a theorem of Falmagne
S Fiorini
Journal of mathematical psychology 48 (1), 80-82, 2004
542004
Approximating weighted tree augmentation via Chvátal-Gomory cuts
S Fiorini, M Groß, J Könemann, L Sanità
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
512018
No Small Linear Program Approximates Vertex Cover Within a Factor 2 − ɛ
A Bazzi, S Fiorini, S Pokutta, O Svensson
Mathematics of Operations Research 44 (1), 147-172, 2019
442019
Planar graph bipartization in linear time
S Fiorini, N Hardy, B Reed, A Vetta
Discrete Applied Mathematics 156 (7), 1175-1180, 2008
412008
Tight results on minimum entropy set cover
J Cardinal, S Fiorini, G Joret
Algorithmica 51, 49-60, 2008
372008
Extended formulations, nonnegative factorizations, and randomized communication protocols
Y Faenza, S Fiorini, R Grappe, HR Tiwary
Combinatorial Optimization: Second International Symposium, ISCO 2012 …, 2012
352012
Sorting under partial information (without the ellipsoid algorithm)
J Cardinal, S Fiorini, G Joret, RM Jungers, JI Munro
Proceedings of the forty-second ACM symposium on Theory of computing, 359-368, 2010
342010
Hitting diamonds and growing cacti
S Fiorini, G Joret, U Pietropaoli
International Conference on Integer Programming and Combinatorial …, 2010
312010
Approximate min–max relations for odd cycles in planar graphs
S Fiorini, N Hardy, B Reed, A Vetta
Mathematical programming 110 (1), 71-91, 2007
312007
A tighter Erdős‐Pósa function for long cycles
S Fiorini, A Herinckx
Journal of Graph Theory 77 (2), 111-116, 2014
302014
Approximating the balanced minimum evolution problem
S Fiorini, G Joret
Operations research letters 40 (1), 31-35, 2012
302012
Determining the automorphism group of the linear ordering polytope
S Fiorini
Discrete applied mathematics 112 (1-3), 121-128, 2001
282001
The price of connectivity for vertex cover
E Camby, J Cardinal, S Fiorini, O Schaudt
Discrete Mathematics & Theoretical Computer Science 16 (Graph Theory), 2014
262014
Extended formulations, nonnegative factorizations, and randomized communication protocols
Y Faenza, S Fiorini, R Grappe, HR Tiwary
Mathematical Programming 153 (1), 75-94, 2015
252015
Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.
Članci 1–20