81 citations · 388 across the 46 of their papers we have counts for
5 papers · 1 filter
The Virtual Private Network Design Problem with Concave Costs (Oberwolfach abstract)
Samuel Fiorini, Gianpaolo Oriolo, Laura Sanità +1
The symmetric Virtual Private Network Design (VPND) problem is concerned with buying capacity on links (edges) in a communication network such that certain traffic demands can be m…
An Efficient Algorithm for Partial Order Production
Jean Cardinal, Samuel Fiorini, Gwenaël Joret +2
We consider the problem of partial order production: arrange the elements of an unknown totally ordered set T into a target partially ordered set S, by comparing a minimum number o…
Weighted graphs defining facets: a connection between stable set and linear ordering polytopes
Jean-Paul Doignon, Samuel Fiorini, Gwenaël Joret
A graph is alpha-critical if its stability number increases whenever an edge is removed from its edge set. The class of alpha-critical graphs has several nice structural properties…
A note on the Cops & Robber game on graphs embedded in non-orientable surfaces
Nancy E. Clarke, Samuel Fiorini, Gwenaël Joret +1
The Cops and Robber game is played on undirected finite graphs. A number of cops and one robber are positioned on vertices and take turns in sliding along edges. The cops win if th…
Minimum Entropy Orientations
Jean Cardinal, Samuel Fiorini, Gwenaël Joret
We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy se…