Samuel Fiorini
Université libre de Bruxelles
166 Papers
1.1K Citations
Samuel Fiorini is an academic researcher from Université libre de Bruxelles. The author has contributed to research in topics: Polytope & Approximation algorithm. The author has an hindex of 23, co-authored 162 publications. Previous affiliations of Samuel Fiorini include HEC Montréal & Acadia University.
Chat about Author
Papers
A <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e228" altimg="si3.svg"><mml:mrow><mml:mn>7</mml:mn><mml:mo>/</mml:mo><mml:mn>3</mml:mn></mml:mrow></mml:math>-approximation algorithm for feedback vertex set in tournaments via Sherali–Adams
TL;DR: In this article , the authors study the feedback vertex set problem in tournaments from the polyhedral point of view, and show that performing just one round of the Sherali-Adams hierarchy gives a relaxation with integrality gap 7/3.
The Polyhedron of all Representations of a Semiorder
Barry Balof,Jean-Paul Doignon,Samuel Fiorini +2 more
- 01 Jan 1997
TL;DR: In this paper, the authors introduce the notion of "noses" and "hollows" of a semi-order P and show that they correspond to the vertices and extreme rays of a polyhedral set R" consisting of all representations of P.
Enumeration of 2-Level Polytopes
Adam Bohn,Yuri Faenza,Samuel Fiorini,Vissarion Fisikopoulos,Marco Macchia,Kanstantsin Pashkovich +5 more
- 01 Jan 2015
TL;DR: In this paper, a simplicial core is proposed to reduce the problem to the enumeration of the closed sets of a discrete closure operator, along with some convex hull computations and isomorphism tests.
A tight Erd\H{o}s-P\'osa function for wheel minors
TL;DR: In this article, the wheel on a planar graph is represented by a constant number of vertices, and it is shown that for every integer n ≥ 3, there is a constant n = c(n) where n is a subgraph with at most n vertices that contain no minor vertices.
The stackelberg minimum spanning tree game
Jean Cardinal,Erik D. Demaine,Samuel Fiorini,Gwenaël Joret,Stefan Langerman,Ilan Newman,Oren Weimann +6 more
- 15 Aug 2007
TL;DR: It is proved that the problem is APX-hard even if there are only two different red costs, and an approximation algorithm whose approximation ratio is at most min is given, which is a natural integer linear programming formulation of the problem.